TOPICS
Search

Search Results for ""


691 - 700 of 4349 for prime numbersSearch Results
A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...
Let E be an elliptic curve defined over the field of rationals Q(sqrt(-d)) having equation y^2=x^3+ax+b with a and b integers. Let P be a point on E with integer coordinates ...
Consider a Lucas sequence with P>0 and Q=+/-1. A Fibonacci pseudoprime is a composite number n such that V_n=P (mod n). There exist no even Fibonacci pseudoprimes with ...
There exist infinitely many odd integers k such that k·2^n-1 is composite for every n>=1. Numbers k with this property are called Riesel numbers, while analogous numbers with ...
If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...
The least genus of any Seifert surface for a given knot. The unknot is the only knot with genus 0. Usually, one denotes by g(K) the genus of the knot K. The knot genus has ...
Murata's constant is defined as C_(Murata) = product_(p)[1+1/((p-1)^2)] (1) = 2.82641999... (2) (OEIS A065485), where the product is over the primes p. It can also be written ...
A cubic number is a figurate number of the form n^3 with n a positive integer. The first few are 1, 8, 27, 64, 125, 216, 343, ... (OEIS A000578). The protagonist Christopher ...
The constant s_0 in Schnirelmann's theorem such that every integer >1 is a sum of at most s_0 primes. Of course, by Vinogradov's theorem, it is known that 4 primes suffice ...
The Motzkin numbers enumerate various combinatorial objects. Donaghey and Shapiro (1977) give 14 different manifestations of these numbers. In particular, they give the ...
1 ... 67|68|69|70|71|72|73 ... 435 Previous Next

...