TOPICS
Search

Search Results for ""


1401 - 1410 of 2617 for Prime Generating PolynomialSearch Results
C_5 is the unique group of group order 5, which is Abelian. Examples include the point group C_5 and the integers mod 5 under addition (Z_5). No modulo multiplication group ...
Let G be a group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...
To divide is to perform the operation of division, i.e., to see how many times a divisor d goes into another number n. n divided by d is written n/d or n÷d. The result need ...
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 ...
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) ...
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 ...
1 ... 138|139|140|141|142|143|144 ... 262 Previous Next

...