SkipCaptcha
126
edits
Changes
Jump to navigation
Jump to search
Line 21:
Line 21: + + − Then let's imagine a description of the case of the three-primed right triangle in which it succeeds, so we can see what follows if it is denied. Let's call any attempted natural number common factor of whatever size ''f''. The sum of a successful division of the prime squares ''l''<sub>1</sub><sup>2</sup> and ''l''<sub>2</sub><sup>2</sup> by attempted factor ''f'' would result, at least in some integer number ''n'' (and in fact would need to be a specific one).+ + +
Rewrite
Conceptualization:
Conceptualization:
Let's imagine a description in which the three primes ''do'' form a right triangle, so we can see what follows.
Let's call the two prime legs ''l''<sub>1</sub> and ''l''<sub>2</sub> and ''h'' the prime hypoteneuse.
Let's call the two prime legs ''l''<sub>1</sub> and ''l''<sub>2</sub> and ''h'' the prime hypoteneuse.
One property, by definition, of a prime number ''p''<sub>1</sub> is that it has no integer factor ''f'' greater than one and less than itself.
===Conceptualization of two prime factors===
[[Category:Plane Geometry]]
[[Category:Plane Geometry]]
[[Category:Mathematics]]
[[Category:Mathematics]]
[[Category:Geometric Theorems]]
[[Category:Geometric Theorems]]