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

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

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

The term quartoid is sometimes used to refer to a function on the form f(x,y)=((x^2+y^2)^2)/(a^3), i.e., a poweroid with alpha=4 (Jackway and Deriche 1996).

The number q in a fraction p/q.

The term "poweroid" has at least two meanings. Sheffer sequences are sometimes called poweroids (Steffensen 1941, Shiu 1982, Di Bucchianico and Loeb 2000). Jackway and ...