The terms of a conditionally convergent series may be rearranged to converge to any prescribed real value. What if the harmonic series is grouped into Fibonacci length blocks? Or the harmonic series is arranged in alternating Fibonacci length blocks? Or rearranged and alternated into separate blocks of even and odd terms of Fibonacci length?

In this capsule we give an elementary proof of the principal axis theorem within the real field, i.e., without using complex numbers.

For a suitably nice, real-valued function "f" defined on an open interval containing [a,b], f(b) can be expressed as p[subscript n](b) (the nth Taylor polynomial of f centered at a) plus an error term of the (Lagrange) form f[superscript (n+1)](c)(b-a)[superscript (n+1)]/(n+1)! for some c in (a,b). This article is for those who think that not…

Fermat's Last Theorem says that for integers n greater than 2, there are no solutions to x[superscript n] + y[superscript n] = z[superscript n] among positive integers. What about rational exponents? Irrational n? Negative n? See what an undergraduate senior seminar discovered.

The boundary between convergent and divergent series is systematically explored through sums of iterated logarithms.

The Stoltz-Cesaro Theorem, a discrete version of l'Hopital's rule, is applied to the summation of integer powers.

We give an irredundant axiomatization of the complete ordered field of real numbers. In particular, we show that all the field axioms for multiplication with the exception of the distributive property may be deduced as "theorems" in our system. We also provide a complete proof that the axioms we have chosen are independent.

We state and prove the methods of False Position (Regula Falsa) and Double False Position (Regula Duorum Falsorum). The history of both is traced from ancient Egypt and China through the work of Fibonacci, ending with a connection between Double False Position and Cramer's Rule.

The fundamental theorem of algebra for the complex numbers states that a polynomial of degree n has n roots, counting multiplicity. This paper explores the "perplex number system" (also called the "hyperbolic number system" and the "spacetime number system") In this system (which has extra roots of +1 besides the usual [plus or minus]1 of the…

Fibonacci's forgotten number is the sexagesimal number 1;22,7,42,33,4,40, which he described in 1225 as an approximation to the real root of x[superscript 3] + 2x[superscript 2] + 10x - 20. In decimal notation, this is 1.36880810785...and it is correct to nine decimal digits. Fibonacci did not reveal his method. How did he do it? There is also a…

Positive sums count. Alternating sums match. Alternating sums of binomial coefficients, Fibonacci numbers, and other combinatorial quantities are analyzed using sign-reversing involutions. In particular, we describe the quantity being considered, match positive and negative terms through an Involution, and count the Exceptions to the matching rule…

Describes a number sequence made by counting the occurrence of each digit from 9 to 0, catenating this count with the digit, and joining these numeric strings to form a new term. Presents a computer-aided proof and an analytic proof of the sequence; compares these two methods of proof. (YP)

We use the sum property for determinants of matrices to give a three-stage proof of an identity involving Fibonacci numbers. Cassini's and d'Ocagne's Fibonacci identities are obtained at the ends of stages one and two, respectively. Catalan's Fibonacci identity is also a special case.

Explored are various aspects of drawing graphs on surfaces. The Euler's formula, Kuratowski's theorem and the drawing of graphs in the plane with as few crossings as possible are discussed. Some applications including embedding of graphs and coloring of maps are included. (YP)