.

>

Printable View

- January 3rd 2008, 01:39 PMyellow4321modulo and congruence classes
.

> - January 3rd 2008, 01:58 PMThePerfectHacker
- January 3rd 2008, 02:37 PMJaneBennet
You want to find an integer

*n*such that 5*n*leaves a remainder 1 when divided by 27. Well, 5 times any integer ends in 0 or 5. So just find a multiple of 27 that ends in 4 or 9, and add 1 to it. 27 × 2 = 54; 54 + 1 = 55 = 5 × 11. So the multiplicative inverse of 5 in is 11.