Search Results for ""
181 - 190 of 1780 for Prime FactorSearch Results
A double Mersenne number is a number of the form M_(M_n)=2^(2^n-1)-1, where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, ...
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, ...
In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...
The Fermat number F_n is prime iff 3^(2^(2^n-1))=-1 (mod F_n).
A map x|->x^p where p is a prime.
The Condon-Shortley phase is the factor of (-1)^m that occurs in some definitions of the spherical harmonics (e.g., Arfken 1985, p. 682) to compensate for the lack of ...
The polar sine is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the lengths of the n edges of the ...
The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...
Two numbers are homogeneous if they have identical prime factors. An example of a homogeneous pair is (6, 72), both of which share prime factors 2 and 3: 6 = 2·3 (1) 72 = ...
A semiprime which English economist and logician William Stanley Jevons incorrectly believed no one else would be able to factor. According to Jevons (1874, p. 123), "Can the ...
...
View search results from all Wolfram sites (10835 matches)

