Proofs and numbers

posted by .

Solve the congruence 24x identical to 42 (mod 30) for x. List all the solutions (if there are any).

  • Proofs and numbers -

    24x = 42 mod 30
    24x = 12 mod 30

    (24-30)x = 12 mod 30
    -6x = 12 mod 30
    x = -2

    so one possible solution is x = -2(24) = -48
    adding/subtracting multiples of 30 , our mod, will yield other solutions
    making -2(24) + 60 , or 12 , our smallest positive answer

    A general solution would be 12 + 30k, where k is an integer
    check:
    look at the sequence of numbers

    ... -108 - 78 - 48 -18 12 42 72 102 ...

    IF we take 102 ÷ 30 we get
    3 + 12/30
    or
    2 + 42/30
    so clearly we can see that 102 = 12 mod 30 = 42 mod 30

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. algebra

    Did I do this problem the correct way if so is there a shorter way to explain this?
  2. math

    Which two is true as i'm confused A) 3+7 ß 10 mod 15 17 + 9 ß 4 mod 21 12 + 14 ß 0 mod 26 B) 4+11 ß 2 mod 13 9+7 ß 4 mod 12 13 + 13 ß 1 mod 25 C) 5+9 ß 4 mod 10 16 + 13 ß 3 mod 26 12 + 7 ß 6 mod 14 d)2+7 …
  3. Math

    What are the 3 solutions? I'm stuck! 6x=15(mod 21) a=6,m=21,b=15 d=gcd(6,21)=3 solns. 6x=15(mod 21) 2x=5(mod 7) 21=6(3)+3 6+3(2)+0 0=6-6 6-(21-6(3))=3 6-21+18=3 6( )-21()=3 (21-6(3))(15)-6=3 ?
  4. Math

    Consider the congruence 6x=15(mod 21). How many solutions does the congruence have?
  5. Math

    Which Statements of congruence are true and which are false and why?
  6. math

    Which Statements of congruence are true and which are false and why?
  7. Math

    Which Statements of congruence are true and which are false and why?
  8. Proofs and numbers

    Prove the following theorem: Suppose p is a prime number, r, s are positive integers and x is an arbitrary integer. Then we have x^r identical to x^s (mod p) whenever r is identical to s (mod 11).for x belongs to an integer
  9. Math

    Find all numbers $r$ for which the system of congruences: x == r mod 6 x == 9 mod 20 x == 4 mod 45 has a solution.
  10. math

    Use Euclid's algorithm to find a multiplicative inverse of 15 mod 88, hence solve the linear congruence 15x=20(mod 88) So far I have: 88=5x15+13 15=1x13+2 Backwards substitution gives 15v+18w=1 1=15-1x13 =15-1(88-5x15) =15x15-1x88 …

More Similar Questions