Search Results for ""

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

A proper factor of a positive integer n is a factor of n other than 1 or n (Derbyshire 2004, p. 32). For example, 2 and 3 are positive proper factors of 6, but 1 and 6 are ...

The notation Q^_ denotes the algebraic closure of the rational numbers Q. This is equivalent to the set of algebraic numbers, sometimes denoted A.

The doublestruck letter R denotes the field of real numbers.

There exist infinitely many n>0 with p_n^2>p_(n-i)p_(n+i) for all i<n, where p_n is the nth prime. Also, there exist infinitely many n>0 such that 2p_n<p_(n-i)+p_(n+i) for ...

A tournament sequence is an increasing sequence of positive integers (t_1, t_2, ...) such that t_1=1 and t_(i+1)<=2t_i. Cook and Kleber (2000) show that Meeussen sequences ...

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

The first few prime Lucas numbers L_n are 2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, ... (OEIS A005479), corresponding to indices n=0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, ...

The Markov numbers m are the union of the solutions (x,y,z) to the Markov equation x^2+y^2+z^2=3xyz, (1) and are related to Lagrange numbers L_n by L_n=sqrt(9-4/(m^2)). (2) ...

product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...