# Cryptology and Number Theory

1. Oct 20, 2009

### viviane363

1. The problem statement, all variables and given/known data

compute 59x +15 $$\equiv$$ 6 mod 811

2. Relevant equations

3. The attempt at a solution

59x $$\equiv$$ -9 mod 811
I really don't know hoow to do from here.

2. Oct 20, 2009

### lanedance

so i think 2 numbers a,b are equivalent in modular arthimetic, mod n, if

a-b = m*n for some integer m

in your case this translates to
59x+9 = 811.m