Search Results for ""

A generalization of the equation whose solution is desired in Fermat's last theorem x^n+y^n=z^n to x^n+y^n=cz^n for x, y, z, and c positive constants, with trivial solutions ...

The golden gnomon is the obtuse isosceles triangle whose ratio of side to base lengths is given by 1/phi=phi-1, where phi is the golden ratio. Such a triangle has angles of ...

A golden rhombohedron is a rhombohedron whose faces consist of congruent golden rhombi. Golden rhombohedra are therefore special cases of a trigonal trapezohedron as well as ...

A triple (a,b,c) of positive integers satisfying a<b<c is said to be harmonic if 1/a+1/c=2/b. In particular, such a triple is harmonic if the reciprocals of its terms form an ...

Let alpha_i and A_i be algebraic numbers such that the A_is differ from zero and the alpha_is differ from each other. Then the expression ...

The sequence defined by G(0)=0 and G(n)=n-G(G(n-1)). (1) The first few terms for n=1, 2, ... are 1, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, ... (OEIS A005206). This can be ...

Machin's formula is given by 1/4pi=4cot^(-1)5-cot^(-1)239. There are a whole class of Machin-like formulas with various numbers of terms (although only four such formulas ...

A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...

Mergelyan's theorem can be stated as follows (Krantz 1999). Let K subset= C be compact and suppose C^*\K has only finitely many connected components. If f in C(K) is ...

The next prime function NP(n) gives the smallest prime larger than n. The function can be given explicitly as NP(n)=p_(1+pi(n)), where p_i is the ith prime and pi(n) is the ...