MHB Question 29- How to conclude the following proof.

  • Thread starter Thread starter cbarker1
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
The discussion focuses on concluding a proof that the square of every odd integer is one more than an integral multiple of 4. Participants clarify that if n is odd, it can be expressed as n = 2l + 1, leading to the equation n^2 = 4l^2 + 4l + 1. This can be rewritten as n^2 = 4k + 1, where k = l^2 + l, confirming the original statement. There is a correction regarding the form of n, emphasizing that it should be n = 2l + 1 rather than n = 1 + 4l. The proof is validated through this algebraic manipulation, establishing the desired conclusion.
cbarker1
Gold Member
MHB
Messages
345
Reaction score
23
Dear Everyone,
I have trouble writing the conclusion of the proof.
29. The square of every odd integer is one more than an integral multiple of 4.
Work:
Let $n\in\Bbb{Z}$
If n is odd, then $n^2=1+4k$ for some $k\in\Bbb{Z}$.

Examples
Let n=3. Then k=2.
Let n=5. Then k=6.
Let n=21. Then k=110.

Proof:
Suppose n is odd. Then $n=1+4l$ for some $l\in\Bbb{Z}$.
Then, $(2l+1)^2=1+4k$
$4l^2+4l+1=1+4k$
$4(l^2+l)+1=1+4k$
Since $4(l^2+l)\in\Bbb{Z}$. Then...

Thanks for the Help,
CBarker1
 
Mathematics news on Phys.org
If $n$ is an odd integer then it is of the form $2k-1$. Squaring, we find $(2k-1)^2=4k^2-4k+1=4(k^2-k)+1$ hence $n^2$ is one more than an integral multiple of $4$.
 
Cbarker1 said:
Dear Everyone,
I have trouble writing the conclusion of the proof.
29. The square of every odd integer is one more than an integral multiple of 4.
Work:
Let $n\in\Bbb{Z}$
If n is odd, then $n^2=1+4k$ for some $k\in\Bbb{Z}$.

Examples
Let n=3. Then k=2.
Let n=5. Then k=6.
Let n=21. Then k=110.

Proof:
Suppose n is odd. Then $n=1+4l$ for some $l\in\Bbb{Z}$.
No. This is not true for n= 3 or 7 or 11, etc. What is true that $n= 1+ 2l$.

Then, $(2l+1)^2=1+4k$
Okay, so the "4" before was a typo. Now, this is what you want to prove.

$4l^2+4l+1=1+4k$
$4(l^2+l)+1=1+4k$
Since $4(l^2+l)\in\Bbb{Z}$. Then...

Thanks for the Help,
CBarker1
Not quite a valid proof because in stating "$(2l+ 1)^2= 4k+ 1$" you are assuming what you want to prove.

Instead, starting with n is odd, so $n= 2l+ 1$, we have $n^2= (2l+ 1)^2= 4l^2+ 4l+ 1= 4(l^2+ l)+ 1= 4k+ 1$ where $k= l^2+ l$.
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K