# Bill's hypothesis or how to make a million dollars and know the entropy

Mathematics is a beautiful and very beautiful science with many areas, theories and branches. However, there is in it a special, “clean” area, a sort of squared mathematics called higher arithmetic. And already there is hiding the basis of the whole of mathematics, its sacred Grail - the elementary theory of numbers that studies, without using the methods of other branches of mathematics, such issues as divisibility of integers, the problem of factorization, Diophantine equations and much more. One of the open problems of this theory is Bill's hypothesis I proved it and show you today. 3r33333.  3r33333. 3r33333.  3r33333. What is this beast? Bill's hypothesis - proposed in 1993 by amateur mathematician Andrew Beal (Andrew Beal) statement with the following wording: if 3r3324. 3r311.
where
3r314.
- natural numbers and 2 \$ "data-tex =" inline "> , Then 3r3323. Have a common prime divisor. Everything would seem simple, but it is only at first glance. ) Bill established a prize of One million dollars, Sounds tempting? Very. At this point, we will consider the entry finished and proceed directly to the proof. 3r-3319.  3r33333. Michalescu's theorem but by definition \$ 2 "data-tex =" inline "> Contradiction.
3r33333. 3r33333.  3r33333. And now attention! Focus! Watch your hands !!! 3r33333.  3r33333. 3r33333.  3r33333.
Sleight of hand, no fraud and a little entropy magic 3r-3284. 3r33333.  3r33333. Since the entropy of a complex system is then for 3r3324. numbers , and therefore defined uniquely. Therefore, the equation is
3r33300.
has no variables and is not an equation, but an equality, and can only have a single solution that puts us in conflict with the condition of the Beal conjecture. Therefore, our assumption is false and
3r3303.
have a common prime divider. 3r33333.  3r33333. 3r33333.  3r33333. 3r3309. Proven [/b] . 3r33333.  3r33333. 3r33333.  3r33333. Literature: L.F. Gromova,
Signs of divisibility of numbers with endings ? ? ? 9 3r33333. 3r33333.  3r33333. 3r33333.  3r33333. P.S. Using the amazing properties of entropy, the computational complexity of the factorization problem can be reduced from 3r3324. up to 3r3324. . I found this truly miraculous proof, which, however, goes far beyond the scope of this post. We will talk about this another time. 3r33333. 3r33333. 3r33333. 3r33333. ! function (e) {function t (t, n) {if (! (n in e)) {for (var r, a = e.document, i = a.scripts, o = i.length; o-- ;) if (-1! == i[o].src.indexOf (t)) {r = i[o]; break} if (! r) {r = a.createElement ("script"), r.type = "text /jаvascript", r.async =! ? r.defer =! ? r.src = t, r.charset = "UTF-8"; var d = function () {var e = a.getElementsByTagName ("script"); e.parentNode.insertBefore (r, e)}; "[object Opera]" == e.opera? a.addEventListener? a.addEventListener ("DOMContentLoaded", d,! 1): e.attachEvent ("onload", d ): d ()}}} t ("//mediator.mail.ru/script/2820404/"""_mediator") () (); 3r33333. 3r33333. 3r33333.
+ 0 -

#### Add comment

• • • 