SOLUTION: Prove or Disprove: For all integers a and n, if (a divides nē) and a < n, then (a divides n).
Algebra
->
Proofs
-> SOLUTION: Prove or Disprove: For all integers a and n, if (a divides nē) and a < n, then (a divides n).
Log On
Logic: Proofs
Logic
Solvers
Solvers
Lessons
Lessons
Answers archive
Answers
Click here to see ALL problems on Proofs
Question 911219
:
Prove or Disprove: For all integers a and n, if (a divides nē) and a < n, then (a divides n).
Answer by
richard1234(7193)
(
Show Source
):
You can
put this solution on YOUR website!
False.
e.g. let a = 4, n = 10. 4 divides 100, but 4 does not divide 10.