TOPICS
Search

Search Results for ""


1311 - 1320 of 2487 for Prime SumsSearch Results
The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...
An abnormal number is a hypothetical number which can be factored into primes in more than one way. Hardy and Wright (1979) prove the fundamental theorem of arithmetic by ...
The compositeness test consisting of the application of Fermat's little theorem.
A sequence of primes q_1<q_2<...<q_k is a Cunningham chain of the first kind (second kind) of length k if q_(i+1)=2q_i+1 (q_(i+1)=2q_i-1) for i=1, ..., k-1. Cunningham primes ...
An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...
The sum of the values of an integral of the "first" or "second" sort int_(x_0,y_0)^(x_1,y_1)(Pdx)/Q+...+int_(x_0,y_0)^(x_N,y_N)(Pdx)/Q=F(z) and ...
Let L(x) denote the Rogers L-function defined in terms of the usual dilogarithm by L(x) = 6/(pi^2)[Li_2(x)+1/2lnxln(1-x)] (1) = ...
An addition chain for a number n is a sequence 1=a_0<a_1<...<a_r=n, such that each member after a_0 is the sum of two earlier (not necessarily distinct) ones. The number r is ...
Given a field F and an extension field K superset= F, an element alpha in K is called algebraic over F if it is a root of some nonzero polynomial with coefficients in F. ...
Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...
1 ... 129|130|131|132|133|134|135 ... 249 Previous Next

...