Search Results for ""
741 - 750 of 1392 for Prime GapsSearch Results

A semiprime which English economist and logician William Stanley Jevons incorrectly believed no one else would be able to factor. According to Jevons (1874, p. 123), "Can the ...
Let P(N) denote the number of primes of the form n^2+1 for 1<=n<=N, then P(N)∼0.68641li(N), (1) where li(N) is the logarithmic integral (Shanks 1960, pp. 321-332). Let Q(N) ...
The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...
Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...
A positive integer n>1 is quiteprime iff all primes p<=sqrt(n) satisfy |2[n (mod p)]-p|<=p+1-sqrt(p). Also define 2 and 3 to be quiteprimes. Then the first few quiteprimes ...
Let x be a positive number, and define lambda(d) = mu(d)[ln(x/d)]^2 (1) f(n) = sum_(d)lambda(d), (2) where the sum extends over the divisors d of n, and mu(n) is the Möbius ...
Special affine curvature, also called as the equi-affine or affine curvature, is a type of curvature for a plane curve that remains unchanged under a special affine ...
A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...
A positive integer n is a veryprime iff all primes p<=sqrt(n) satisfy {|2[n (mod p)]-p|<=1 very strong; |2[n (mod p)]-p|<=sqrt(p) strong; |2[n (mod p)]-p|<=p/2 weak. (1) The ...
Given a positive nondecreasing sequence 0<lambda_1<=lambda_2<=..., the zeta-regularized product is defined by product_(n=1)^^^inftylambda_n=exp(-zeta_lambda^'(0)), where ...

...