Saturday, February 27, 2016

modular arithmetic - Solving cubic congruence


I wasn't actually taught about cubic congruences equation and was managing with quadratic congruences until I was hit with this: x353( mod 120)

Effort: I tried deconstructing it into a system of congruence equation assuming that there is several congruences towards prime decomposition of 120=358 but ended up using Chinese remainder theorem to solve it into 53 (which was quite silly).


I also tried putting it into x3530( mod 120) and use Special Algebra Expansions a3b3 or (ab)3 but got stuck. A few useful hints would be appreciated. Thank you.


Answer



Using CRT:


  • x335332x32

  • x355353x52

  • x385385x85

This implies that x152 and x85, which is the same as saying x2150 and x283. The first number 8k+3 that is divisible by 15 is 75, so x12077


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...