Search Results for ""
371 - 380 of 3987 for Lawof Large NumbersSearch Results
A number which is simultaneously a heptagonal number H_n and square number S_m. Such numbers exist when 1/2n(5n-3)=m^2. (1) Completing the square and rearranging gives ...
A composite number defined analogously to a Smith number except that the sum of the number's digits equals the sum of the digits of its distinct prime factors (excluding 1). ...
Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...
A number which is simultaneously a pentagonal number P_n and a square number S_m. Such numbers exist when 1/2n(3n-1)=m^2. (1) Completing the square gives ...
A figurate number of the form StOct_n = O_n+8Te_(n-1) (1) = n(2n^2-1), (2) where O_n is an octahedral number and Te_n is a tetrahedral number. The first few are 1, 14, 51, ...
Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...
The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...
A law is a mathematical statement which always holds true. Whereas "laws" in physics are generally experimental observations backed up by theoretical underpinning, laws in ...
An n-digit number that is the sum of the nth powers of its digits is called an n-narcissistic number. It is also sometimes known as an Armstrong number, perfect digital ...
A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...
...
View search results from all Wolfram sites (41452 matches)

