TOPICS
Search

Search Results for ""


31 - 40 of 507 for Rabin Miller Strong Pseudoprime TestSearch Results
A subspace A of X is called a strong deformation retract of X if there is a homotopy F:X×I->X (called a retract) such that for all x in X, a in A, and t in I, 1. F(x,0)=x, 2. ...
A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.
The graph strong product, also known as the graph AND product or graph normal product, is a graph product variously denoted G□AdjustmentBox[x, BoxMargins -> {{-0.65, ...
Given a Hilbert space H, the sigma-strong operator topology is the topology on the algebra L(H) of bounded operators from H to itself defined as follows: A sequence S_i of ...
The compositeness test consisting of the application of Fermat's little theorem.
Let u_k be a series with positive terms and suppose rho=lim_(k->infty)(u_(k+1))/(u_k). Then 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series diverges. ...
An Euler pseudoprime to the base b is a composite number n which satisfies b^((n-1)/2)=+/-1 (mod n). The first few base-2 Euler pseudoprimes are 341, 561, 1105, 1729, 1905, ...
Let sumu_k be a series with positive terms and let f(x) be the function that results when k is replaced by x in the formula for u_k. If f is decreasing and continuous for ...
A test for the convergence of Fourier series. Let phi_x(t)=f(x+t)+f(x-t)-2f(x), then if int_0^pi(|phi_x(t)|dt)/t is finite, the Fourier series converges to f(x) at x.
A test for the primality of Fermat numbers F_n=2^(2^n)+1, with n>=2 and k>=2. Then the two following conditions are equivalent: 1. F_n is prime and (k/F_n)=-1, where (n/k) is ...
1|2|3|4|5|6|7 ... 51 Previous Next

...