TOPICS
Search

Search Results for ""


701 - 710 of 1364 for Pi DigitsSearch Results
The Reidemeister move of type I.
A number v=xy with an even number n of digits formed by multiplying a pair of n/2-digit numbers (where the digits are taken from the original number in any order) x and y ...
A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...
Feynman (1997, p. 116) noticed the curious fact that the decimal expansion 1/(243)=0.004115226337448559... (1) repeats pairs of the digits 0, 1, 2, 3, ... separated by the ...
A number having 666 digits (where 666 is the beast number) is called an apocalypse number. The Fibonacci number F_(3184) is the smallest Fibonacci apocalypse number (Livio ...
Approximations to Catalan's constant include K approx (9/(10))^(5/6) (1) approx ln(ln892)-1 (2) approx (1/(96))^(1/52) (3) approx (4/(51))^(1/29) (4) approx ...
Let G be a group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...
A double factorial prime is a prime number of the form n!!+/-1, where n!! is a double factorial. n!!-1 is prime for n=3, 4, 6, 8, 16, 26, 64, 82, 90, 118, 194, 214, 728, ... ...
Legion's number of the first kind is defined as L_1 = 666^(666) (1) = 27154..._()_(1871 digits)98016, (2) where 666 is the beast number. It has 1881 decimal digits. Legion's ...
The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...
1 ... 68|69|70|71|72|73|74 ... 137 Previous Next

...