Search Results for ""

The term "continuum" has (at least) two distinct technical meanings in mathematics. The first is a compact connected metric space (Kuratowski 1968; Lewis 1983, pp. 361-394; ...

Defining p_0=2, p_n as the nth odd prime, and the nth prime gap as g_n=p_(n+1)-p_n, then the Cramér-Granville conjecture states that g_n<M(lnp_n)^2 for some constant M>1.

A set partition of the rational numbers into two nonempty subsets S_1 and S_2 such that all members of S_1 are less than those of S_2 and such that S_1 has no greatest ...

If q_n is the nth prime such that M_(q_n) is a Mersenne prime, then q_n∼(3/2)^n. It was modified by Wagstaff (1983) to yield Wagstaff's conjecture, q_n∼(2^(e^(-gamma)))^n, ...

Engineering notation is a version of scientific notation in which the exponent p in expressions of the form a×10^p is chosen to always be divisible by 3. Numbers of forms ...

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 converse of Fermat's little theorem is also known as Lehmer's theorem. It states that, if an integer x is prime to m and x^(m-1)=1 (mod m) and there is no integer e<m-1 ...

Let (x_1,x_2) and (y_1,y_2) be two sets of complex numbers linearly independent over the rationals. Then the four exponential conjecture posits that at least one of ...

Let f(x) be a monic polynomial of degree d with discriminant Delta. Then an odd integer n with (n,f(0)Delta)=1 is called a Frobenius pseudoprime with respect to f(x) if it ...

The function z=f(x)=ln(x/(1-x)). (1) This function has an inflection point at x=1/2, where f^('')(x)=(2x-1)/(x^2(x-1)^2)=0. (2) Applying the logit transformation to values ...