Search Results for ""

The decimal expansion of a number is its representation in base-10 (i.e., in the decimal system). In this system, each "decimal place" consists of a digit 0-9 arranged such ...

A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...

The Pell numbers are the numbers obtained by the U_ns in the Lucas sequence with P=2 and Q=-1. They correspond to the Pell polynomial P_n(x) and Fibonacci polynomial F_n(x) ...

Every position of every impartial game has a nim-value, making it equivalent to a nim-heap. To find the nim-value (also called the Sprague-Grundy number), take the mex of the ...

Let E be a simply connected compact set in the complex plane. By the Riemann mapping theorem, there is a unique analytic function ...

For a given monic quartic equation f(x)=x^4+a_3x^3+a_2x^2+a_1x+a_0, (1) the resolvent cubic is the monic cubic polynomial g(x)=x^3+b_2x^2+b_1x+b_0, (2) where the coefficients ...

If an aliquot sequence {s^0(n),s(n),s^2(n),...} for a given n is bounded, it either ends at s(1)=0 or becomes periodic. If the sequence is periodic (or eventually periodic), ...

In a 1631 edition of Academiae Algebrae, J. Faulhaber published the general formula for the power sum of the first n positive integers, sum_(k=1)^(n)k^p = H_(n,-p) (1) = ...