Search Results for ""

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

A Sierpiński number of the first kind is a number of the form S_n=n^n+1. The first few are 2, 5, 28, 257, 3126, 46657, 823544, 16777217, ... (OEIS A014566). Sierpiński proved ...

A sum-product number is a number n such that the sum of n's digits times the product of n's digit is n itself, for example 135=(1+3+5)(1·3·5). (1) Obviously, such a number ...

The logarithm log_bx for a base b and a number x is defined to be the inverse function of taking b to the power x, i.e., b^x. Therefore, for any x and b, x=log_b(b^x), (1) or ...

A number t_x=tan^(-1)(1/x)=cot^(-1)x, where x is an integer or rational number, tan^(-1)x is the inverse tangent, and cot^(-1)x is the inverse cotangent. Gregory numbers ...

In the archaic terminology of Whittaker and Watson (1990), the complex number z representing x+iy.

The set theory symbol (aleph) for the cardinal number of a well-orderable infinite set.

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

A number n is called an economical number if the number of digits in the prime factorization of n (including powers) uses fewer digits than the number of digits in n. The ...

A number which is simultaneously pentagonal and hexagonal. Let P_n denote the nth pentagonal number and H_m the mth hexagonal number, then a number which is both pentagonal ...