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 askyip •  3 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

askyip
3 years ago by

Downvoting a post can decrease pending rewards and make it less visible. Common reasons:

  • Disagreement on rewards
  • Fraud or plagiarism
  • Hate speech or trolling
  • Miscategorized content or spam

Submit
$0.00
    0
    Authors get paid when people like you upvote their post.
    If you enjoyed what you read here, create your account today and start earning FREE STEEM!