Are two integers coprime if they are coprime mod(n)?

  • Thread starter jack476
  • Start date
  • #1
324
125

Homework Statement


Show that out of a set of ten consecutive integers, at least one is coprime to all of the others.

Homework Equations


Lemma: Out of a set of n consecutive integers, exactly one is divisible by n. (Given).

The Attempt at a Solution


Let a1, a2...a10 be consecutive integers. Let a11(mod10), a2≡ 2(mod10)...a100(mod10).

Observe that 7 is coprime to the other integers from 1 to 10. Does this mean that 7(mod10) is coprime to the other integers in ℤ10, and if so, does this mean that a7 is coprime to the other ai?

Also, sorry that I've been throwing so many questions on here in the last few weeks. Thank you all for being so patient :)
 

Answers and Replies

  • #2
324
125
Never mind, 7 has a multiplicative inverse, 3, in the integers modulo 10, so it can divide the other elements.
 

Related Threads on Are two integers coprime if they are coprime mod(n)?

  • Last Post
Replies
3
Views
2K
Replies
3
Views
6K
Replies
5
Views
8K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
1
Views
3K
Replies
5
Views
4K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
4
Views
1K
Top