Search Results for ""

Pick two real numbers x and y at random in (0,1) with a uniform distribution. What is the probability P_(even) that [x/y], where [r] denotes the nearest integer function, is ...

An integer n>1 is said to be highly cototient if the equation x-phi(x)=n has more solutions than the equations x-phi(x)=k for all 1<k<n, where phi is the totient function. ...

The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...

Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...

An improper use of the symbol sqrt(-1) for the imaginary unit leads to the apparent proof of a false statement. sqrt(-1) = sqrt(-1) (1) sqrt((-1)/1) = sqrt(1/(-1)) (2) ...

A q-analog, also called a q-extension or q-generalization, is a mathematical expression parameterized by a quantity q that generalizes a known expression and reduces to the ...

The Pell polynomials P(x) are the W-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. This gives recursive equations for P(x) from ...

"Arabic numerals" are the numerical symbols 1, 2, 3, 4, 5, 6, 7, 8, 9, and 0. Historically, Indian numerals evolved in Arab usage roughly 1000 A.D., and there was rare ...

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.