Is n congruent to 1 mod 5 if n is congruent to 6 mod 5?

  • Thread starter Thread starter TheMathNoob
  • Start date Start date
Click For Summary
If n is congruent to 6 mod 5, then it can be expressed as n = 5k + 6 for some integer k. Simplifying this, n can also be shown to be congruent to 1 mod 5, as 5 divides n - 1. The discussion also touches on a separate inquiry about whether 16 is congruent to 2 mod 7, clarifying that it is indeed congruent because 16 can be represented as 2 more than a multiple of 7. The mathematical reasoning confirms that congruences can yield valid results without requiring the second number to be a perfect square. Overall, the conclusions drawn reinforce the principles of modular arithmetic.
TheMathNoob
Messages
189
Reaction score
4

Homework Statement


if n is congruent to 6 mod 5
then n is congruent to 1 mod 5?

Homework Equations

The Attempt at a Solution


[/B]
This is not a problem. It's a doubt that I have
 
Physics news on Phys.org
TheMathNoob said:

Homework Statement


if n is congruent to 6 mod 5
then n is congruent to 1 mod 5?

Homework Equations

The Attempt at a Solution


[/B]
This is not a problem. It's a doubt that I have
Can you write 6 as congruent to x mod 5? What is x?
 
ehild said:
Can you write 6 as congruent to x mod 5? What is x?
x is a number between 0 and 5
 
What does it mean that a number n is congruent to x mod 5?
 
ehild said:
What does it mean that a number n is congruent to x mod 5?
5 divides n-x
 
TheMathNoob said:
5 divides n-x
Yes, but you said that x must be between 0 and 5. Which number is x if n=6?
 
TheMathNoob said:
5 divides n-x
ehild said:
Yes, but you said that x must be between 0 and 5. Which number is x if n=6?
I got it by algebra 5 divides n-6 so n-6=5k, n=5(k+1)+1, so 5 divides n-1 which implies n is congruent to 1 mod 5. I am having another inquiry with my friend. He claims that 16 is not congruent to 2 mod 7 because he thinks that a^2 congruent to b mod n implies that b has to be a perfect square. Is that correct?
 
TheMathNoob said:
I got it by algebra 5 divides n-6 so n-6=5k, n=5(k+1)+1, so 5 divides n-1 which implies n is congruent to 1 mod 5.
Correct.
TheMathNoob said:
I am having another inquiry with my friend. He claims that 16 is not congruent to 2 mod 7 because he thinks that a^2 congruent to b mod n implies that b has to be a perfect square. Is that correct?

a congruent to b mod n implies that a=kn+b. It follows that a2=(kn+b)2=k2n2+2knb+b2. If you divide that by n, the remainder is b2. But that remainder can be greater than n. It is the case with your example. 16 = 42, and 4 is 4 mod 7, so k=0, and b2=16. You have to do the division further to get 16 = 2*7+2. 16 is congruent to 2 mod 7.
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 27 ·
Replies
27
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 28 ·
Replies
28
Views
6K