Search Results for ""

Let B_k be the kth Bernoulli number and consider nB_(n-1)=-1 (mod n), where the residues of fractions are taken in the usual way so as to yield integers, for which the ...

The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...

If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...

The Cramér conjecture is the unproven conjecture that lim sup_(n->infty)(p_(n+1)-p_n)/((lnp_n)^2)=1, where p_n is the nth prime.

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...

Let p be a prime number, G a finite group, and |G| the order of G. 1. If p divides |G|, then G has a Sylow p-subgroup. 2. In a finite group, all the Sylow p-subgroups are ...

A solitary number is a number which does not have any friends. Solitary numbers include all primes, prime powers, and numbers for which (n,sigma(n))=1, where (a,b) is the ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

A Dedekind ring is a commutative ring in which the following hold. 1. It is a Noetherian ring and a integral domain. 2. It is the set of algebraic integers in its field of ...

Bertelsen's number is an erroneous name erroneously given to the erroneous value of pi(10^9)=50847478, where pi(x) is the prime counting function. This value is 56 lower than ...