Hi all It now looks like that I have proven that there are only 5 fermat primes as it is conjectured to be. Furthermore I believe to have proven that there are infinetely many primes of the form N^2+1

Hello Unsolved Problem Solvers, Further to my previous proof there was one counter example which has now been resolved. If the fourth parameter is even that leaves one cuboid with 3 even sides which c

Hi All I Have an idea for a geometric picture, which may turn out to look beautiful or reveal something interesting. The idea is to make a picture of triangels which have all sides prime. Make triange

Hi all I have found that if the attached inequality is true, for sufficiently high values then there are infinetely many primes of the form N^2+1. If it is impossible to determine which one the sides

hello U.P. solvers... Further to my proof that _no_ 3x3 Magic Square of Squares can exist it follows that no other 3x3 Magic Square of _any_ Power can exist apart from power = 1. The reason being is t

Fermat the last proof with Pitagora and Binomial develop just I hope the .pdf in attachment will arrive still if heavy. I've asked to Tim for the pubblication on the wesite. Any comments is welcome. H

Hi all, I've recently been asked again about peer-reviewed journals. A comprehensive list can be found at JOURNALS SPECIALIZING IN NUMBER THEORY. All are highly reputable. The format and submission re

Hi all, There is a new contribution re the Collatz Conjecture on the UP site at http://unsolvedproblems.org/index_files/Solutions.htm It is very short and very simple, and the author would welcome fee

Hi All It seems to me that I have found an inductive proof of Goldbach conjecture. It is pretty simple, so it should not take too long to figure out whether it is valid or not. Kim

Hello, This morning I came up with an expression for perfect numbers with help of WDF "Wave Divisor Function". See picture below: if the expression is true one has found a perfect number x. Hope I did

Yes. While I am not familiar with Möbius geometry in two dimensions, I am familiar with Euler's formula e^(ix) = cos(x) + i sin(x) which implies that multiplication by the complex number z = r (cos(x)

Hi All It seems to me that I have proven that if Goldbach conjecture is false then it must have infinitely many counter examples. I wonder whether it is known if Goldbach conjecture can have only fini

I have found that the solutions to 0/0=y are y=complex numbers. It is just like x°2=4, so x=-2, 2. For example, 0/0=0 because 0x0=0 and 0/0=2.718 because 2.718x0=0. Danny Karl Fleming

I'm derailed ? Or is it the (right) most elegant way to close the FLT proof ? It is really possible to arrive at such conclusion without performing the whole calculation (for each n) ? ... because I n

This is in response to Enrique Santos L's e-mail to me, who asked me to comment on his contribution here, titled "Every perfect number has only one odd prime factor". In the section titled "A simpler

Hi all, Several new contributions recently. http://unsolvedproblems.org/index_files/Solutions.htm Tim

I have played with my factoring program today. My goal is to see how large a number I can factor nearly instantly. This is my test run for today. Python 3.7.1 (v3.7.1:260ec2c36a, Oct 20 2018, 14:57:15

Re:. . .The reason you switch to binary is because you are dividing by two. The holy grail is to get one bit turned on and all the rest off. That way when you divide by 2 you shift the bit to the righ

[1] (x y z + 1)^2 – (x y z -1)^2­­­ = (y z + x)^2 – (y z – x)^2 = (x z + y)^2 – (x z – y)^2 = (x y + z)^2 – (x y – y)^2 = 4 x y z [2] x = q1^2 p2 p3; y = p1 q2^2 p3; z = p1 p2 q3^2 [3] (p1^2 p2^2 p3^2

http://shorturl.at/ltwzJ