Search Results for ""

Schur (1916) proved that no matter how the set of positive integers less than or equal to |_n!e_| (where |_x_| is the floor function) is partitioned into n classes, one class ...

A recursive primality certificate for a prime p. The certificate consists of a list of 1. A point on an elliptic curve C y^2=x^3+g_2x+g_3 (mod p) for some numbers g_2 and ...

The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...

A phi-prime is a prime number appearing in the decimal expansion of the golden ratio phi. The first few are 1618033, 1618033988749, ... (OEIS A064117). The numbers of decimal ...

A pi-prime is a prime number appearing in the decimal expansion of pi. The known examples are 3, 31, 314159, 31415926535897932384626433832795028841, ... (OEIS A005042). The ...

A Smarandache-Wellin number that is prime is known as a Smarandache-Wellin prime. Concatenations of the first n=1, 2, 4, 128, 174, 342, 435, 1429 (OEIS A046035; Ibstedt 1998, ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) = (n+1; 3)+n+1 (1) = 1/6(n+1)(n^2-n+6) (2) = 1/6(n^3+5n+6), (3) where (a; ...

Decimal is the base-10 notational system for representing real numbers. The expression of a number using the decimal system is called its decimal expansion, examples of which ...