Search Results for ""

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then Lochs' ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

A prime power is a prime or integer power of a prime. A test for a number n being a prime is implemented in the Wolfram Language as PrimePowerQ[n]. The first few prime powers ...

Consider a network of n resistors R_i so that R_2 may be connected in series or parallel with R_1, R_3 may be connected in series or parallel with the network consisting of ...

The tangent numbers, also called a zag number, and given by T_n=(2^(2n)(2^(2n)-1)|B_(2n)|)/(2n), (1) where B_n is a Bernoulli number, are numbers that can be defined either ...

The 10.1.2 equation A^(10)=B^(10)+C^(10) (1) is a special case of Fermat's last theorem with n=10, and so has no solution. No 10.1.n solutions are known with n<13. A 10.1.13 ...

A Thâbit ibn Kurrah prime, sometimes called a 321-prime, is a Thâbit ibn Kurrah number (i.e., a number of the form 3·2^n-1 for nonnegative integer n) that is prime. The ...

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.

A catastrophe which can occur for one control factor and one behavior axis. It is the universal unfolding of the singularity f(x)=x^3 and has the equation F(x,u)=x^3+ux.