Search Results for ""

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 base-4 method of counting in which only the digits 0, 1, 2, and 3 are used. The illustration above shows the numbers 0 to 63 represented in quaternary, and the following ...

The base 16 notational system for representing real numbers. The digits used to represent numbers using hexadecimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, ...

Given two starting numbers (a_1,a_2), the following table gives the unique sequences {a_i} that contain no three-term arithmetic progressions. Sloane sequence A003278 1, 2, ...

The digits in the number 2187 form the two vampire numbers: 21×87=1827 and 2187=27×81. 2187 is also given by 3^7.

An arrangement of overlapping circles which cover the entire plane. A lower bound for a covering using equivalent circles is 2pi/sqrt(27) (Williams 1979, p. 51).

A sextic surface given by the implicit equation 4(x^2+y^2+z^2-13)^3+27(3x^2+y^2-4z^2-12)^2=0.

Fermat's sandwich theorem states that 26 is the only number sandwiched between a perfect square number (5^2=25) and a perfect cubic number (3^3=27). According to Singh ...

The substitution of x=w-p/(3w) (1) into the standard form cubic equation x^3+px=q. (2) The result reduces the cubic to the equation w^3-(p^3)/(27w^3)-q=0, (3) which is easily ...

1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...