Search Results for ""

Let (x_1,x_2) and (y_1,y_2) be two sets of complex numbers linearly independent over the rationals. Then the four exponential conjecture posits that at least one of ...

Let f(x) be a monic polynomial of degree d with discriminant Delta. Then an odd integer n with (n,f(0)Delta)=1 is called a Frobenius pseudoprime with respect to f(x) if it ...

The function z=f(x)=ln(x/(1-x)). (1) This function has an inflection point at x=1/2, where f^('')(x)=(2x-1)/(x^2(x-1)^2)=0. (2) Applying the logit transformation to values ...

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

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) ...

The second theorem of Mertens states that the asymptotic form of the harmonic series for the sum of reciprocal primes is given by sum_(p<=x)1/p=lnlnx+B_1+o(1), where p is a ...

The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...

Niven's theorem states that if x/pi and sinx are both rational, then the sine takes values 0, +/-1/2, and +/-1. Particular cases include sin(pi) = 0 (1) sin(pi/2) = 1 (2) ...

The set of octonions, also sometimes called Cayley numbers and denoted O, consists of the elements in a Cayley algebra. A typical octonion is of the form ...

Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...