Let n ≥ 1 be an integer. Show that in any set of n consecutive integers, there is exactly one that is divisible by n. Hint: Express the smallest integer in the set as q ⋅n+r, where q, r are integers satisfying 0 ≤ r ≤ n−1.

in #askyip3 years ago

Question : Let n ≥ 1 be an integer. Show that in any set of n consecutive integers, there is exactly one that is divisible by n.
Hint: Express the smallest integer in the set as q ⋅n+r, where q, r are integers satisfying 0 ≤ r ≤ n−1.

Answer:
Capture 1.PNG

Capture.PNG

Coin Marketplace

STEEM 0.18
TRX 0.23
JST 0.034
BTC 97092.83
ETH 2922.37
SBD 3.64