TOPICS
Search

Search Results for ""


1301 - 1310 of 2617 for Prime Generating PolynomialSearch Results
A function of a single variable (e.g., f(x), g(z), theta(xi), etc.).
The q-binomial coefficient is a q-analog for the binomial coefficient, also called a Gaussian coefficient or a Gaussian polynomial. A q-binomial coefficient is given by [n; ...
Consecutive number sequences are sequences constructed by concatenating numbers of a given type. Many of these sequences were considered by Smarandache and so are sometimes ...
The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...
A modified Miller's primality test which gives a guarantee of primality or compositeness. The algorithm's running time for a number n has been proved to be as ...
The Copeland-Erdős constant is the constant with decimal expansion 0.23571113171923... (OEIS A033308) obtained by concatenating consecutive primes: 2, 23, 235, 2357, 235711, ...
A cyclic number is an (n-1)-digit integer that, when multiplied by 1, 2, 3, ..., n-1, produces the same digits in a different order. Cyclic numbers are generated by the full ...
Two oriented knots (or links) can be summed by placing them side by side and joining them by straight bars so that orientation is preserved in the sum. The knot sum is also ...
A rational amicable pair consists of two integers a and b for which the divisor functions are equal and are of the form sigma(a)=sigma(b)=(P(a,b))/(Q(a,b))=R(a,b), (1) where ...
If one root of the equation f(x)=0, which is irreducible over a field K, is also a root of the equation F(x)=0 in K, then all the roots of the irreducible equation f(x)=0 are ...
1 ... 128|129|130|131|132|133|134 ... 262 Previous Next

...