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.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.4: Prime Factors And Greatest Common Divisor
Problem 10E: Let be a nonzero integer and a positive integer. Prove or disprove that .
icon
Related questions
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.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Relations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning