Search Results for ""
1821 - 1830 of 2487 for Prime SumsSearch Results
The constants C_n defined by C_n=[int_0^infty|d/(dt)((sint)/t)^n|dt]-1. (1) These constants can also be written as the sums C_n=2sum_(k=1)^infty(1+x_k^2)^(-n/2), (2) and ...
The h-statistic h_r is the unique symmetric unbiased estimator for a central moment of a distribution <h_r>=mu_r. (1) In addition, the variance var(h_r)=<(h_r-mu_r)^2> (2) is ...
Define the nome by q=e^(-piK^'(k)/K(k))=e^(ipitau), (1) where K(k) is the complete elliptic integral of the first kind with modulus k, K^'(k)=K(sqrt(1-k^2)) is the ...
A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...
An amphichiral knot is a knot that is capable of being continuously deformed into its own mirror image. More formally, a knot K is amphichiral (also called achiral or ...
While the Catalan numbers are the number of p-good paths from (n,n) to (0,0) which do not cross the diagonal line, the super Catalan numbers count the number of lattice paths ...
A congruence of the form f(x)=0 (mod n) where f(x) is an integer polynomial (Nagell 1951, p. 73).
A compositeness certificate is a piece of information which guarantees that a given number p is composite. Possible certificates consist of a factor of a number (which, in ...
Let the residue from Pépin's theorem be R_n=3^((F_n-1)/2) (mod F_n), where F_n is a Fermat number. Selfridge and Hurwitz use R_n (mod 2^(35)-1,2^(36),2^(36)-1). A ...
A witness is a number which, as a result of its number theoretic properties, guarantees either the compositeness or primality of a number n. Witnesses are most commonly used ...
...
View search results from all Wolfram sites (13197 matches)

