Search Results for ""

If, for n>=0, beta_n=sum_(r=0)^n(alpha_r)/((q;q)_(n-r)(aq;q)_(n+r)), (1) then beta_n^'=sum_(r=0)^n(alpha_r^')/((q;q)_(n-r)(aq;q)_(n+r)), (2) where alpha_r^' = ...

A transformation formula for continued fractions (Lorentzen and Waadeland 1992) which can, for example, be used to prove identities such as ...

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

The Jacobi triple product is the beautiful identity product_(n=1)^infty(1-x^(2n))(1+x^(2n-1)z^2)(1+(x^(2n-1))/(z^2))=sum_(m=-infty)^inftyx^(m^2)z^(2m). (1) In terms of the ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

A q-series is series involving coefficients of the form (a;q)_n = product_(k=0)^(n-1)(1-aq^k) (1) = product_(k=0)^(infty)((1-aq^k))/((1-aq^(k+n))) (2) = ...

The 2-1 equation A^n+B^n=C^n (1) is a special case of Fermat's last theorem and so has no solutions for n>=3. Lander et al. (1967) give a table showing the smallest n for ...

The lemniscate functions arise in rectifying the arc length of the lemniscate. The lemniscate functions were first studied by Jakob Bernoulli and Giulio Fagnano. A historical ...