A direct method is given for solving first-order linear recurrences with constant coefficients. The limiting value of that solution is studied as "n to infinity." This classroom note could serve as enrichment material for the typical introductory course on discrete mathematics that follows a calculus course.

An elementary proof using matrix theory is given for the following criterion: if "F"/"K" and "L"/"K" are field extensions, with "F" and "L" both contained in a common extension field, then "F" and "L" are linearly disjoint over "K" if (and only if) some…

This note explains how Emil Artin's proof that row rank equals column rank for a matrix with entries in a field leads naturally to the formula for the nullity of a matrix and also to an algorithm for solving any system of linear equations in any number of variables. This material could be used in any course on matrix theory or linear algebra.

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…

This note uses the analytic notion of asymptotic functions to study when a function is asymptotic to a polynomial function. Along with associated existence and uniqueness results, this kind of asymptotic behaviour is related to the type of asymptote that was recently defined in a more geometric way. Applications are given to rational functions and…

If f is a continuous positive-valued function defined on the closed interval from a to x and if k[subscript 0] is greater than 0, then lim[subscript k[right arrow]0[superscript +] [integral][superscript x] [subscript a] f (t)[superscript k-k[subscript 0]] dt= [integral][superscript x] [subscript a] f (t)[superscript -k[subscript 0] dt. This…

This note develops and implements the theory of polynomial asymptotes to (graphs of) rational functions, as a generalization of the classical topics of horizontal asymptotes and oblique/slant asymptotes. Applications are given to hyperbolic asymptotes. Prerequisites include the division algorithm for polynomials with coefficients in the field of…

The main purpose of this note is to present and justify proof via iteration as an intuitive, creative and empowering method that is often available and preferable as an alternative to proofs via either mathematical induction or the well-ordering principle. The method of iteration depends only on the fact that any strictly decreasing sequence of…

Two heuristic and three rigorous arguments are given for the fact that functions of the form Ce[kx], with C an arbitrary constant, are the only solutions of the equation dy/dx=ky where k is constant. Various of the proofs in this self-contained note could find classroom use in a first-year calculus course, an introductory course on differential…

This note could find use as enrichment material in a course on the classical geometries; its preliminary results could also be used in an advanced calculus course. It is proved that if a , b and c are positive real numbers such that a[squared] + b[squared] = c[squared] , then cosh ( a ) cosh ( b ) greater than cosh ( c ). The proof of this result…

Six proofs are given for the fact that for each integer n [greater than or equal to] 2, the nth root function, viewed as a function from the set of non-negative real numbers to itself, is not linear. If p is a prime number, then [Zeta]/p[Zeta] is characterized, up to isomorphism, as the only integral domain D of characteristic p such that D admits…

Three proofs are given for the fact that the derivative of an everywhere-positive non-constant real polynomial function must change sign. This self-contained note could find classroom use in courses on calculus or abstract algebra.