TOPICS
Search

Search Results for ""


4361 - 4370 of 13135 for General Number Field SieveSearch Results
For |q|<1, the Rogers-Ramanujan identities are given by (Hardy 1999, pp. 13 and 90), sum_(n=0)^(infty)(q^(n^2))/((q)_n) = 1/(product_(n=1)^(infty)(1-q^(5n-4))(1-q^(5n-1))) ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
The 5.1.2 fifth-order Diophantine equation A^5=B^5+C^5 (1) is a special case of Fermat's last theorem with n=5, and so has no solution. improving on the results on Lander et ...
The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written ...
An integral of the form intf(z)dz, (1) i.e., without upper and lower limits, also called an antiderivative. The first fundamental theorem of calculus allows definite ...
A matrix is a concise and useful way of uniquely representing and working with linear transformations. In particular, every linear transformation can be represented by a ...
A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...
The m×n queen graph Q_(m,n) is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a queen. ...
A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...
A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...
1 ... 434|435|436|437|438|439|440 ... 1314 Previous Next

...