Search Results for ""

Let a and b be nonzero integers such that a^mb^n!=1 (except when m=n=0). Also let T(a,b) be the set of primes p for which p|(a^k-b) for some nonnegative integer k. Then ...

A Stoneham number is a number alpha_(b,c) of the form alpha_(b,c)=sum_(k=1)^infty1/(b^(c^k)c^k), where b,c>1 are relatively prime positive integers. Stoneham (1973) proved ...

Taniguchi's constant is defined as C_(Taniguchi) = product_(p)[1-3/(p^3)+2/(p^4)+1/(p^5)-1/(p^6)] (1) = 0.6782344... (2) (OEIS A175639), where the product is over the primes ...

Trigonometric functions of npi/11 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 11 is not a ...

Trigonometric functions of npi/13 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 13 is not a ...

Trigonometric functions of npi/9 radians for n an integer not divisible by 3 (e.g., 40 degrees and 80 degrees) cannot be expressed in terms of sums, products, and finite root ...

The trigyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating three of the pentagonal cupolas of a small rhombicosidodecahedron by 1/10 of a turn ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

Willans' formula is a prime-generating formula due to Willan (1964) that is defined as follows. Let F(j) = |_cos^2[pi((j-1)!+1)/j]_| (1) = {1 for j=1 or j prime; 0 otherwise ...

Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...