Claim: Every odd integer square is an element of some Pythagorean triple.
We first show that every positive odd number 2n+1 is equivalent to the expression (n+1)2 - n2.
We have (n+1)2 - n2 = (n+1+n)(n+1-n) = 2n+1.
An arbitrary odd square m2 = 2n+1 = (n+1)2 - n2.
That is, m2 = (n+1)2 - n2 or
m2 + n2 = (n+1)2.
Note that we may let n+1 = k, for k2 - (k-1)2
= (k+k-1)(k- k- 1) = -(2k -1) = 1 - 2k.
So, expressed this way, we obtain all the negative odd numbers.
We see this by
2n + 1 = 1 - 2k
or 2n = -2k
or n = -k.
Some Ryle essay footnotes appear on this site, which is devoted to life after physics.
There is no claim of expertise with respect to the musings on this page. Never use my stuff for homework!
Friday, July 14, 2023
Subscribe to:
Posts (Atom)
Your example: [(p-->q) + (q --> p)] [~(p-->q) v (~q --> p]).~[q p] Dot means "and." The above can be r...
-
ar68. In an essay attributed to Franz Lieber, a 19th Century German-American philosopher, Hegel's monism is described thus: For Hegel a...
-
The following is a proposed proof. Topology's Jordan curve theorem, first proposed in 1887 by Camille Jordan, asserts that an...
-
Title Goes Here This is my web page