Search Results for ""

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

For elliptic curves over the rationals Q, the group of rational points is always finitely generated (i.e., there always exists a finite set of group generators). This theorem ...

Brocard's conjecture states that pi(p_(n+1)^2)-pi(p_n^2)>=4 for n>=2, where pi(n) is the prime counting function and p_n is the nth prime. For n=1, 2, ..., the first few ...

The inverse curve of the circle with parametric equations x = acost (1) y = asint (2) with respect to an inversion circle with center (x,y) and radius R is given by x_i = ...

Given a source S and a curve gamma, pick a point on gamma and find its tangent T. Then the locus of reflections of S about tangents T is the orthotomic curve (also known as ...

Let A=a_(ij) be a matrix with positive coefficients and lambda_0 be the positive eigenvalue in the Frobenius theorem, then the n-1 eigenvalues lambda_j!=lambda_0 satisfy the ...

Coordinates useful for plotting projective three-dimensional curves of the form f(x_0,x_1,x_2,x_3)=0 which are defined by x_0 = 1-z-sqrt(2)x (1) x_1 = 1-z+sqrt(2)x (2) x_2 = ...

The hippopede, also known as the horse fetter, is a curve given by the polar equation r^2=4b(a-bsin^2theta). Hippopedes are plotted above for values of a/b=0.2 to 2.0.

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...