Search Results for ""

A phenomenon in which a system being forced at an irrational period undergoes rational, periodic motion which persists for a finite range of forcing values. It may occur for ...

Every irrational number x can be expanded in a unique continued fraction expansion x=b_0+(e_1)/(b_1+(e_2)/(b_2+(e_3)/(b_3+...)))=[b_0;e_1b_1,e_2b_2,e_3b_3,...] such that b_0 ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

Any set which can be put in a one-to-one correspondence with the natural numbers (or integers) so that a prescription can be given for identifying its members one at a time ...

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

If theta is a given irrational number, then the sequence of numbers {ntheta}, where {x}=x-|_x_|, is dense in the unit interval. Explicitly, given any alpha, 0<=alpha<=1, and ...

Consider the decimal expansion of the reciprocal of the number seven, 1/7=0.142857142857...=0.142857^_, (1) which is a repeating decimal. Now take overlapping pairs of these ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

The factorization of a number into its constituent primes, also called prime decomposition. Given a positive integer n>=2, the prime factorization is written ...