Many tertiary institutions with mathematics programmes offer introduction to proof courses to ease mathematics students' transition from primarily calculation-based courses like Calculus and differential equations to proof-centred courses like real analysis and number theory. However, unlike most tertiary mathematics courses, whose mathematical…

This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…

Computer technologies and especially computer algebra systems (CAS) allow students to overcome some of the difficulties they encounter in the study of real numbers. The teaching of calculus can be considerably more effective with the use of CAS provided the didactics of the discipline makes it possible to reveal the full computational potential of…

It is proved that an integer n [greater than or equal] 2 is a prime (resp., composite) number if and only if there exists exactly one (resp., more than one) nth-degree monic polynomial f with coefficients in Z[subscript n], the ring of integers modulo n, such that each element of Z[subscript n] is a root of f. This classroom note could find use in…

The study aimed to investigate students' conceptions on the notion of absolute value and their abilities in applying the specific notion in routine and non-routine situations. A questionnaire was constructed and administered to 17-year-old students. Data were analysed using the hierarchical clustering of variables and the implicative method, while…

The floor function maps a real number to the largest previous integer. More precisely, floor(x)=[x] is the largest integer not greater than x. The square bracket notation [x] for the floor function was introduced by Gauss in his third proof of quadratic reciprocity in 1808. The floor function is also called the greatest integer or entier (French…

This article introduces a trigonometric field (TF) that extends the field of real numbers by adding two new elements: sin and cos--satisfying an axiom sin[superscript 2] + cos[superscript 2] = 1. It is shown that by assigning meaningful names to particular elements of the field, all known trigonometric identities may be introduced and proved. Two…

We present a calculation involving a wide class of real integrals by means of integration in the complex plane. Some particular cases where Euler numbers and Bell polynomials appear are discussed and a generalisation of some previous results is also provided. (Contains 1 table and 1 figure.)

A general method is presented for evaluating the sums of "m"th powers of the integers that can, and that cannot, be represented in the two-element Frobenius problem. Generating functions are introduced and used for that purpose. Explicit formulas for the desired sums are obtained and specific examples are discussed.

This article provides a survey of some basic results in algebraic number theory and applies this material to prove that the cyclotomic integers generated by a seventh root of unity are a unique factorization domain. Part of the proof uses the computer algebra system Maple to find and verify factorizations. The proofs use a combination of historic…

Four proofs, designed for classroom use in varying levels of courses on abstract algebra, are given for the converse of the classical Chinese Remainder Theorem over the integers. In other words, it is proved that if m and n are integers greater than 1 such that the abelian groups [double-struck z][subscript m] [direct sum] [double-struck…

A k-dimensional integer point is called visible if the line segment joining the point and the origin contains no proper integer points. This note proposes an explicit formula that represents the number of visible points on the two-dimensional [1,N]x[1,N] integer domain. Simulations and theoretical work are presented. (Contains 5 figures and 2…

Euler's famous formula, e to the (i, pi) power equals -1, is developed by a purely algebraic method that avoids the use of both trigonometry and calculus. A heuristic outline is given followed by the rigorous theory. Pedagogical considerations for classroom presentation are suggested. (LS)

Using the modular ring Zeta[subscript 4], simple algebra is used to study diophantine equations of the form (x[cubed]-a=y[squared]). Fermat challenged his contemporaries to solve this equation when a = 2. They were unable to do so, although Fermat had devised a rather complicated proof himself. (Contains 2 tables.)

Part of the report by the Committee on Support of Research in the Mathematical Sciences is presented. It deals with an overview of the mathematical sciences from past to present. (JG)