Search Results for ""

A 3-multiperfect number P_3. Six sous-doubles are known (120, 672, 523776, 459818240, 1476304896, and 51001180160; OEIS A005820), and these are believed to comprise all ...

A 4-multiperfect number P_4. 36 sous-triples are known (30240, 32760, 2178540, 23569920, ...; OEIS A027687), and these are believed to comprise all sous-triples.

1000=10^3. The word "thousand" appears in common expressions in a number of languages, for example, "a thousand pardons" in English and "tusen takk" ("a thousand thanks") in ...

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

Let the greatest term H of a sequence be a term which is greater than all but a finite number of the terms which are equal to H. Then H is called the upper limit of the ...

Let P(N) denote the number of primes of the form n^2+1 for 1<=n<=N, then P(N)∼0.68641li(N), (1) where li(N) is the logarithmic integral (Shanks 1960, pp. 321-332). Let Q(N) ...

Take any positive integer of two digits or more, reverse the digits, and add to the original number. This is the operation of the reverse-then-add sequence. Now repeat the ...

Rational numbers are countable, so an order can be placed on them just like the natural numbers. Although such an ordering is not obvious (nor unique), one such ordering can ...

A Fermat prime is a Fermat number F_n=2^(2^n)+1 that is prime. Fermat primes are therefore near-square primes. Fermat conjectured in 1650 that every Fermat number is prime ...

The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...