Search Results for ""
1301 - 1310 of 2487 for Prime SumsSearch Results
666 is the occult "number of the beast," also called the "sign of the devil" (Wang 1994), associated in the Bible with the Antichrist. It has figured in many numerological ...
Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...
The Weierstrass elliptic functions (or Weierstrass P-functions, voiced "p-functions") are elliptic functions which, unlike the Jacobi elliptic functions, have a second-order ...
An infinite sequence of positive integers 1<=b_1<b_2<b_3<..., (1) also called a Sidon sequence, such that all pairwise sums b_i+b_j (2) for i<=j are distinct (Guy 1994). An ...
The direct product is defined for a number of classes of algebraic objects, including sets, groups, rings, and modules. In each case, the direct product of an algebraic ...
A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...
Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...
The Feit-Thompson conjecture asserts that there are no primes p and q for which (p^q-1)/(p-1) and (q^p-1)/(q-1) have a common factor. Parker noticed that if this were true, ...
There are so many theorems due to Fermat that the term "Fermat's theorem" is best avoided unless augmented by a description of which theorem of Fermat is under discussion. ...
The 9.1.2 equation A^9=B^9+C^9 (1) is a special case of Fermat's last theorem with n=9, and so has no solution. No 9.1.3, 9.1.4, 9.1.5, 9.1.6, 9.1.7, 9.1.8, or 9.1.9 ...
...
View search results from all Wolfram sites (13197 matches)

