Thread: modular arithmetic help

Hey everyone, I am finding these difficult and need some help solving these by hand.

1. , so I want the remainder of .

2. solve , so I am trying to use Euler's Theorem with a=26 and n=35.


Any help would be very nice.

Thanks.

Originally Posted by Nguyen

Hey everyone, I am finding these difficult and need some help solving these by hand.

1. , so I want the remainder of .

2. solve , so I am trying to use Euler's Theorem with a=26 and n=35..

Outline strategy for 1.: , so use Fermat's little theorem to find mod 7, mod 11 and mod 13. Then use the Chinese remainder theorem to piece the results together.

For 2., you can't "solve" something that isn't an equation. But if you want to verify that then use a similar strategy to 1., namely factorise 35 (and check that the result holds mod 5 and mod 7).