TOPICS
Search

Search Results for ""


201 - 210 of 507 for Rabin Miller Strong Pseudoprime TestSearch Results
If lim_(k->infty)u_k!=0, then the series {u_n} diverges.
The Fermat number F_n is prime iff 3^(2^(2^n-1))=-1 (mod F_n).
Calculus I
A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) (1) for every choice of a satisfying (a,n)=1 (i.e., a and n are ...
A recursive primality certificate for a prime p. The certificate consists of a list of 1. A point on an elliptic curve C y^2=x^3+g_2x+g_3 (mod p) for some numbers g_2 and ...
The first few prime Lucas numbers L_n are 2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, ... (OEIS A005479), corresponding to indices n=0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, ...
The Jacobian of the derivatives partialf/partialx_1, partialf/partialx_2, ..., partialf/partialx_n of a function f(x_1,x_2,...,x_n) with respect to x_1, x_2, ..., x_n is ...
Let delta=z>=z_(observed). A value 0<=alpha<=1 such that P(delta)<=alpha is considered "significant" (i.e., is not simply due to chance) is known as an alpha value. The ...
S_n=sum_(i)eta_imu(E_i), where mu(E_i) is the measure of the set E_i of points on the x-axis for which f(x) approx eta_i.
An unknot which can only be unknotted by first increasing the number of crossings.
1 ... 18|19|20|21|22|23|24 ... 51 Previous Next

...