In this note, we revisit the problem of polynomial interpolation and explicitly construct two polynomials in n of degree k + 1, P[subscript k](n) and Q[subscript k](n), such that P[subscript k](n) = Q[subscript k](n) = f[subscript k](n) for n = 1, 2,… , k, where f[subscript k](1), f[subscript k](2),… , f[subscript k](k) are k arbitrarily chosen…

We use the hyperbolic cotangent function to deduce another proof of Euler's formula for ?(2n).

Like Pascal's triangle, Faulhaber's triangle is easy to draw: all you need is a little recursion. The rows are the coefficients of polynomials representing sums of integer powers. Such polynomials are often called Faulhaber formulae, after Johann Faulhaber (1580-1635); hence we dub the triangle Faulhaber's triangle.

The systematic use of alternative normalization constants for 3j symbols can lead to a more natural expression of quantities, such as vector products and spherical tensor operators. The redefined coupling constants directly equate tensor products to the inner and outer products without any additional square roots. The approach is extended to…

For at least 2000 years people have been trying to calculate the value of [pi], the ratio of the circumference to the diameter of a circle. People know that [pi] is an irrational number; its decimal representation goes on forever. Early methods were geometric, involving the use of inscribed and circumscribed polygons of a circle. However, real…

Pascal's triangle is an arrangement of the binomial coefficients in a triangle. Each number inside Pascal's triangle is calculated by adding the two numbers above it. When all the odd integers in Pascal's triangle are highlighted (black) and the remaining evens are left blank (white), one of many patterns in Pascal's triangle is displayed. By…

A. Lobb discovered an interesting generalization of Catalan's parenthesization problem, namely: Find the number L(n, m) of arrangements of n + m positive ones and n - m negative ones such that every partial sum is nonnegative, where 0 = m = n. This article uses Lobb's formula, L(n, m) = (2m + 1)/(n + m + 1) C(2n, n + m), where C is the usual…

Everyone knows what makes a 3-4-5 triangle special, but how many know what makes a 4-5-6 triangle special? It is an integer-sided triangle in which one angle is twice another. It is enjoyable to search for these things, but for those who are impatient, this article derives explicit polynomial formulas that generate all of the basic examples of…

There has been a lot of material written about logarithmic spirals of golden proportion but this author states that he has never come across an article that states the exact equation of the spiral which ultimately spirals tangentially to the sides of the rectangles. In this article, the author intends to develop such an equation. (Contains 5…

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…

This paper is written on a level accessible to college/university students of mathematics who are taking second-year, algebra based, mathematics courses beyond calculus I. This article combines material from geometry, trigonometry, and number theory. This integration of various techniques is an excellent experience for the serious student. The…