Search Results for ""
3381 - 3390 of 4217 for Strong Lawof Small NumbersSearch Results
![](/common/images/search/spacer.gif)
Primorial primes are primes of the form p_n#+/-1, where p_n# is the primorial of p_n. A coordinated search for such primes is being conducted on PrimeGrid. p_n#-1 is prime ...
Two integers are relatively prime if they share no common positive factors (divisors) except 1. Using the notation (m,n) to denote the greatest common divisor, two integers m ...
The Ulam sequence {a_i}=(u,v) is defined by a_1=u, a_2=v, with the general term a_n for n>2 given by the least integer expressible uniquely as the sum of two distinct earlier ...
Pre-Algebra
Pre-Calculus
In antiquity, geometric constructions of figures and lengths were restricted to the use of only a straightedge and compass (or in Plato's case, a compass only; a technique ...
The Champernowne constant has decimal expansion C=0.1234567891011... (OEIS A033307). The Earls sequence (starting position of n copies of the digit n) for e is given for n=1, ...
The hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...
Construct a square equal in area to a circle using only a straightedge and compass. This was one of the three geometric problems of antiquity, and was perhaps first attempted ...
The Copeland-Erdős constant has decimal expansion C=0.23571113... (OEIS A033308). The Earls sequence (starting position of n copies of the digit n) for e is given for n=1, 2, ...
![](/common/images/search/spacer.gif)
...