Search Results for ""

In the American system, 10^(63).

Catalan (1876, 1891) noted that the sequence of Mersenne numbers 2^2-1=3, 2^3-1=7, and 2^7-1=127, and (OEIS A007013) were all prime (Dickson 2005, p. 22). Therefore, the ...

The initially palindromic numbers 1, 121, 12321, 1234321, 123454321, ... (OEIS A002477). For the first through ninth terms, the sequence is given by the generating function ...

A theorem, also known as Bachet's conjecture, which Bachet inferred from a lack of a necessary condition being stated by Diophantus. It states that every positive integer can ...

An Argand diagram is a plot of complex numbers as points z=x+iy in the complex plane using the x-axis as the real axis and y-axis as the imaginary axis. In the plot above, ...

The cubefree part is that part of a positive integer left after all cubic factors are divided out. For example, the cubefree part of 24=2^3·3 is 3. For n=1, 2, ..., the first ...

The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...

The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

A pair of numbers m and n such that sigma(m)=sigma(n)=m+n-1, where sigma(m) is the divisor function. Beck and Najar (1977) found 11 augmented amicable pairs.