Search Results for ""
1081 - 1090 of 1780 for Prime FactorSearch Results
The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...
Fischer's z-distribution is the general distribution defined by g(z)=(2n_1^(n_1/2)n_2^(n_2/2))/(B((n_1)/2,(n_2)/2))(e^(n_1z))/((n_1e^(2z)+n_2)^((n_1+n_2)/2)) (1) (Kenney and ...
A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...
A Goldbach number is a positive integer that is the sum of two odd primes (Li 1999). Let E(x) (the "exceptional set of Goldbach numbers") denote the number of even numbers ...
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 ...
...
View search results from all Wolfram sites (10835 matches)

