Search Results for ""

If the first case of Fermat's last theorem is false for the prime exponent p, then 3^(p-1)=1 (mod p^2).

An elliptic curve of the form y^2=x^3+n for n an integer. This equation has a finite number of solutions in integers for all nonzero n. If (x,y) is a solution, it therefore ...

An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

p^~=|phi_i(x)><phi_i(t)| (1) p^~sum_(j)c_j|phi_j(t)>=c_i|phi_i(x)> (2) sum_(i)|phi_i(x)><phi_i(x)|=1. (3)

Ramanujan's two-variable theta function f(a,b) is defined by f(a,b)=sum_(n=-infty)^inftya^(n(n+1)/2)b^(n(n-1)/2) (1) for |ab|<1 (Berndt 1985, p. 34; Berndt et al. 2000). It ...

Somos's quadratic recurrence constant is defined via the sequence g_n=ng_(n-1)^2 (1) with g_0=1. This has closed-form solution ...

An elliptic integral is an integral of the form int(A(x)+B(x)sqrt(S(x)))/(C(x)+D(x)sqrt(S(x)))dx, (1) or int(A(x)dx)/(B(x)sqrt(S(x))), (2) where A(x), B(x), C(x), and D(x) ...

The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...

Gradshteyn and Ryzhik (2000) define the circulant determinant by (1) where omega_j is the nth root of unity. The second-order circulant determinant is |x_1 x_2; x_2 ...