Search Results for ""

Any nonzero rational number x can be represented by x=(p^ar)/s, (1) where p is a prime number, r and s are integers not divisible by p, and a is a unique integer. The p-adic ...

The series producing Brun's constant converges even if there are an infinite number of twin primes, first proved by Brun (1919).

A cyclic number is an (n-1)-digit integer that, when multiplied by 1, 2, 3, ..., n-1, produces the same digits in a different order. Cyclic numbers are generated by the full ...

There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...

A number is said to be pandigital if it contains each of the digits from 0 to 9 (and whose leading digit must be nonzero). However, "zeroless" pandigital quantities contain ...

The Pell-Lucas numbers are the V_ns in the Lucas sequence with P=2 and Q=-1, and correspond to the Pell-Lucas polynomial Q_n(1). The Pell-Lucas number Q_n is equal to ...

The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

A sequence of numbers V={nu_n} is complete if every positive integer n is the sum of some subsequence of V, i.e., there exist a_i=0 or 1 such that n=sum_(i=1)^inftya_inu_i ...

There exists a positive integer s such that every sufficiently large integer is the sum of at most s primes. It follows that there exists a positive integer s_0>=s such that ...