HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Prove directly that if n is an odd integer, then n² - 1 is divisible by 8…
HardMathematicsHigh School (11–12)Mathematical ReasoningproofNumerical

Prove directly that if n is an odd integer, then n² - 1 is divisible by 8…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Prove directly that if nnn is an odd integer, then n2−1n^2 - 1n2−1 is divisible by 888. Write nnn in terms of another integer, factorise, and explain why one factor is even. Then check the result for n=15n = 15n=15: find n2−18\dfrac{n^2 - 1}{8}8n2−1​. Finally, decide whether the converse "if n2−1n^2 - 1n2−1 is divisible by 888, then nnn is odd" is true, and give a short reason.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Direct proof: assume ppp, reach qqq. Contrapositive: assume ∼q\sim q∼q, reach ∼p\sim p∼p. Exhaustion: check every one of finitely many cases. One counterexample disproves a for-all claim.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Set up. Let n=2k+1n = 2k + 1n=2k+1, with kkk an integer.

Step 2. Factorise. n2−1=4k2+4k=4k(k+1)n^2 - 1 = 4k^2 + 4k = 4k(k + 1)n2−1=4k2+4k=4k(k+1).

Step 3. One factor is even. Of two consecutive integers kkk and k+1k + 1k+1, one is even. So k(k+1)=2mk(k + 1) = 2mk(k+1)=2m for an integer mmm, and n2−1=8mn^2 - 1 = 8mn2−1=8m.

Step 4. Check. n=15n = 15n=15: 152−1=224=8×2815^2 - 1 = 224 = 8 \times 28152−1=224=8×28. So the quotient is 282828.

Step 5. The converse. If nnn were even, n2n^2n2 would be even and n2−1n^2 - 1n2−1 odd, so not divisible by 888. That proves the contrapositive of the converse. So the converse is true and has no counterexample.

Answer: proof complete; the quotient for n=15n = 15n=15 is 282828.

Log in to save this for later
← All Problems
← Validate the statement "for a real number x, x² - 5x + 6 = 0 if and only if x = 2 or x = 3"…For integers a and b, prove that if a + b ≥ 15, then a ≥ 8 or b ≥ 8… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Direct proof, contrapositive and counterexampleValid Arguments and Methods of Proof

More on this topic

  1. Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3…Advanced
  2. Prove by contradiction that there are no integers a and b with 6a + 9b = 100…Advanced
  3. Prove by contradiction that √3 is irrational…Hard
Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…Advanced
  • The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…Advanced
  • All problems on this topic →