Search Results for ""

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

For every positive integer n, there is a unique finite sequence of distinct nonconsecutive (not necessarily positive) integers k_1, ..., k_m such that ...

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

For the rational curve of an unperturbed system with rotation number r/s under a map T (for which every point is a fixed point of T^s), only an even number of fixed points ...

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

A fixed point which has one zero eigenvector.

A fixed point for which the stability matrix has equal nonzero eigenvectors.

The number q in a fraction p/q.