Search Results for ""

A power floor prime sequence is a sequence of prime numbers {|_theta^n_|}_n, where |_x_| is the floor function and theta>1 is real number. It is unknown if, though extremely ...

The trinomial triangle is a number triangle of trinomial coefficients. It can be obtained by starting with a row containing a single "1" and the next row containing three 1s ...

Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...

Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...

The square-triangle theorem states that any nonnegative integer can be represented as the sum of a square, an even square, and a triangular number (Sun 2005), i.e., ...

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

Let u_(B,b)(n) be the number of digit blocks of a sequence B in the base-b expansion of n. The following table gives the sequence {u_(B)(n)} for a number of blocks B. B OEIS ...

If p and q are distinct odd primes, then the quadratic reciprocity theorem states that the congruences x^2=q (mod p) x^2=p (mod q) (1) are both solvable or both unsolvable ...

Consider two closed oriented space curves f_1:C_1->R^3 and f_2:C_2->R^3, where C_1 and C_2 are distinct circles, f_1 and f_2 are differentiable C^1 functions, and f_1(C_1) ...