Hello I am stuck on a homework problem for the question of trying to prove that for any integer n,n^2 +5 is not divisible by 4. I looked at a step by step guide and i'm confused by the answer. The step by step solution resulted in 2 cases with even resulting in n^2 + 5 = 4m+1 for n is even as proof that n^2 + 5 is not divisible by 4. Shouldn’t the 4m indicate that it is divisible? Thank you I am somewhat confused by this math concept.
Hello I am stuck on a homework problem for the question of trying to prove that for any integer n,n^2 +5 is not divisible by 4. I looked at a step by step guide and i'm confused by the answer. The step by step solution resulted in 2 cases with even resulting in n^2 + 5 = 4m+1 for n is even as proof that n^2 + 5 is not divisible by 4. Shouldn’t the 4m indicate that it is divisible? Thank you I am somewhat confused by this math concept.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Hello I am stuck on a homework problem for the question of trying to prove that for any integer n,n^2 +5 is not divisible by 4. I looked at a step by step guide and i'm confused by the answer.
The step by step solution resulted in 2 cases with even resulting in
n^2 + 5 = 4m+1 for n is even as proof that n^2 + 5 is not divisible by 4. Shouldn’t the 4m indicate that it is divisible? Thank you I am somewhat confused by this math concept.
![### Explanation of Solution
#### Given information:
Any integer \( n \).
#### Formula used:
- \( x \) is even if and only if there exists an integer \( k \) such that \( x = 2k \).
- \( x \) is odd if and only if there exists an integer \( k \) such that \( x = 2k + 1 \).
#### Proof:
Suppose integer \( n \).
We divide into cases accordingly:
#### Case 1: \( n \) is even.
If \( n \) is even, then \( n \) is divisible by 2.
So, \( n = 2k \), where \( k \) is any integer.
When \( n \) is divisible by 2, then \( n^2 \) is also divisible by 2.
\[
n^2 + 5 = (2k)^2 + 5
\]
\[
n^2 + 5 = 4k^2 + 5 = 4k^2 + 4 + 1 = 4(k^2 + 1) + 1
\]
let \( k^2 + 1 = m \)
\[
n^2 + 5 = 4m + 1
\]
When \( n \) is even, we can see that \( n^2 + 5 \) is not divisible by 4.
#### Case 2: \( n \) is odd
By the definition of odd, for integer \( k \) such that,
\[
n = 2k + 1
\]
\[
n^2 + 5 = (2k + 1)^2 + 5
\]
\[
n^2 + 5 = 4k^2 + 4k + 1 + 5 = 4k^2 + 4k + 6 = 4k^2 + 4k + 4 + 2 = 4(k^2 + k + 1) + 2
\]
let \( m = k^2 + k + 1 \)
\[
n^2 + 5 = 4m + 2
\]
When \( n \) is odd, we can see that \( n^2 + 5 \) is not divisible by 4.
Hence for any integer \( n \), \( n^2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F5fa81c3b-3cb0-4e43-b006-c221cc3289cb%2F098521c7-b18f-4ffa-9db2-2b4ce7dda337%2F8e0wu4_processed.png&w=3840&q=75)
Transcribed Image Text:### Explanation of Solution
#### Given information:
Any integer \( n \).
#### Formula used:
- \( x \) is even if and only if there exists an integer \( k \) such that \( x = 2k \).
- \( x \) is odd if and only if there exists an integer \( k \) such that \( x = 2k + 1 \).
#### Proof:
Suppose integer \( n \).
We divide into cases accordingly:
#### Case 1: \( n \) is even.
If \( n \) is even, then \( n \) is divisible by 2.
So, \( n = 2k \), where \( k \) is any integer.
When \( n \) is divisible by 2, then \( n^2 \) is also divisible by 2.
\[
n^2 + 5 = (2k)^2 + 5
\]
\[
n^2 + 5 = 4k^2 + 5 = 4k^2 + 4 + 1 = 4(k^2 + 1) + 1
\]
let \( k^2 + 1 = m \)
\[
n^2 + 5 = 4m + 1
\]
When \( n \) is even, we can see that \( n^2 + 5 \) is not divisible by 4.
#### Case 2: \( n \) is odd
By the definition of odd, for integer \( k \) such that,
\[
n = 2k + 1
\]
\[
n^2 + 5 = (2k + 1)^2 + 5
\]
\[
n^2 + 5 = 4k^2 + 4k + 1 + 5 = 4k^2 + 4k + 6 = 4k^2 + 4k + 4 + 2 = 4(k^2 + k + 1) + 2
\]
let \( m = k^2 + k + 1 \)
\[
n^2 + 5 = 4m + 2
\]
When \( n \) is odd, we can see that \( n^2 + 5 \) is not divisible by 4.
Hence for any integer \( n \), \( n^2
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps

Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question
For the previous problem how did you calculate for 1,5,17,and 37 for proving that n^2 + 1 is not divisible by 4. Thanks sorry i'm still confused on how to check for divisibility of a proofs.
Solution
Recommended textbooks for you

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,

