Search Results for ""

Simplemindedly, a number theoretic transform is a generalization of a fast Fourier transform obtained by replacing e^(-2piik/N) with an nth primitive root of unity. This ...

A near noble number is a real number 0<nu<1 whose continued fraction is periodic, and the periodic sequence of terms is composed of a string of p-1 1s followed by an integer ...

A Thâbit ibn Kurrah number, sometimes called a 321-number, is a number of the form K_n=3·2^n-1. The first few for n=0, 1, ... are 2, 5, 11, 23, 47, 95, 191, 383, 767, ... ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...

A complex number z is said to be purely imaginary if it has no real part, i.e., R[z]=0. The term is often used in preference to the simpler "imaginary" in situations where z ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

A floating-point number is a finite or infinite number that is representable in a floating-point format, i.e., a floating-point representation that is not a NaN. In the IEEE ...