Search Results for ""
381 - 390 of 1944 for Hundred Dollar Hundred Digit Challenge P...Search Results
Disconnectivities are mathematical entities which stand in the way of a space being contractible (i.e., shrunk to a point, where the shrinking takes place inside the space ...
To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...
The recursive sequence generated by the recurrence equation Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2)), with Q(1)=Q(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 5, 6, 6, ... (OEIS ...
Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...
Dickson (1913, 2005) defined an amicable triple to be a triple of three numbers (l,m,n) such that s(l) = m+n (1) s(m) = l+n (2) s(n) = l+m, (3) where s(n) is the restricted ...
Numbers which are not perfect and for which s(N)=sigma(N)-N<N, or equivalently sigma(n)<2n, where sigma(N) is the divisor function. Deficient numbers are sometimes called ...
A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...
An Abelian variety which is canonically attached to an algebraic variety which is the solution to a certain universal problem. The Albanese variety is dual to the Picard ...
The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.
For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.
...
View search results from all Wolfram sites (27602 matches)

