User talk:Logman1

Soon it will be published Goldbach''s conjecture: Every even integer greater than 2 can be written as the sum of two primes. http://logman-logman.narod.ru/--Logman1 (talk) 22:31, 15 January 2009 (UTC)

Are there infinitely many primes p such that p - 1 is a perfect square? – Yes. Soon it will be published Landau's conjecture: http://logman-logman.narod.ru/--Logman1 (talk) 21:18, 16 January 2009 (UTC)--Logman1 (talk) 08:40, 22 January 2009 (UTC)

On January, 27th, 2009 the first issue of International Mathematical Journal «UNSOLVED PROBLEMS IN MATHEMATICS» has come off the press. http://logman-logman.narod.ru/--Logman1 (talk) 20:31, 27 January 2009 (UTC)

SOLUTION OF BEAL’S CONJECTURE: http://logman-logman.narod.ru/--Logman1 (talk) 22:34, 11 February 2009 (UTC) SOLUTION OF FERMAT’S LAST THEOREM IS PUBLISHED, where it is proved that Fermat’s Theorem (x^n + y^n = z^n) consists of three absolutely different matters: 1) n = 3, 2) n = 4, 3) n > 4, where n – is a prime number. The following question appears: “How have Andrew Wiles solved the theorem using just one algorithm of solution, without division of Fermat’s Last Theorem on n = 3 and n > 3 (where n – is a prime number)?--Logman1 (talk) 17:56, 14 February 2009 (UTC)

Under the arrangement I will solve any problem under the theory of numbers. I will sell the solutions of two mathematical problems: 1. Solution Goldbach''s conjecture: Every even integer greater than 2 can be written as the sum of two primes. logman1@list.ru 2. Solution Landau''s problems: It is conjectured there are infinitely many primes of the form n^2 + 1. http://logman-logman.narod.ru/--Logman1 (talk) 09:42, 6 March 2009 (UTC)

Through the Electronic Frontier Foundation (EFF) Cooperative Computing Awards, EFF will confer prizes of (http://www.eff.org/awards/coop): $150000 to the first individual or group who discovers a prime number with at least 100000000 decimal digits. $250000 to the first individual or group who discovers a prime number with at least 1000000000 decimal digits. I have discovered a formula of “Terrible prime numbers”. The quantity of places included into these “Terrible prime numbers” is superiorly infinite. These numbers are not Mersen’s numbers. The Proof is understandable: http://logman-logman.narod.ru/--Logman1 (talk) 18:15, 26 April 2009 (UTC)