Why Does a Solution Exist for the Congruence Equation 59x + 15 ≡ 6 mod n?

  • Thread starter Thread starter viviane363
  • Start date Start date
  • Tags Tags
    Cryptology
viviane363
Messages
17
Reaction score
0

Homework Statement


Let n be a positive integer. Consider the congruence equation 59x + 15 congruent to 6 mod n
For this equation, a solution x exits. Why?

Homework Equations


The Attempt at a Solution


there is a k such that
(59x +15) - 6 = kn
(59x +15) - kn = 6
59x - kn = 6 - 15
59x - kn = -9
there is a linear combination of 59 and k that gives -9
But then, I don't know if this is the right way to go and what to do now!
Thanks to help
 
Physics news on Phys.org
If n=59 there is no solution. You have to know something about n to decide whether there is a solution.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
1
Views
1K
Replies
27
Views
2K
Replies
2
Views
1K
Replies
4
Views
4K
Replies
1
Views
5K
Replies
9
Views
3K
Replies
11
Views
2K
Back
Top