Search Results for ""
161 - 170 of 3905 for Fibonacci NumbersSearch Results
The Jacobsthal numbers are the numbers obtained by the U_ns in the Lucas sequence with P=1 and Q=-2, corresponding to a=2 and b=-1. They and the Jacobsthal-Lucas numbers (the ...
A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...
A Liouville number is a transcendental number which has very close rational number approximations. An irrational number beta is called a Liouville number if, for each n, ...
A natural number n>3 such that n|(a^(n-2)-a) whenever (a,n)=1 (a and n are relatively prime) and a<=n. (Here, n|m means that n divides m.) There are an infinite number of ...
In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...
A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...
A unitary perfect number is a number n which is the sum of its unitary divisors with the exception of n itself. There are no odd unitary perfect numbers, and it has been ...
A shuffling algorithm used in a class of random number generators.
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
Fermat's sandwich theorem states that 26 is the only number sandwiched between a perfect square number (5^2=25) and a perfect cubic number (3^3=27). According to Singh ...
...
View search results from all Wolfram sites (31257 matches)

