Question: Prove that there exist infinitely many composite number n for which a-1 = a(mod n) (04) (04) Find an integer having remainders 2, 3,
Prove that there exist infinitely many composite number n for which a-1 = a(mod n) (04) (04) Find an integer having remainders 2, 3, 4, 5 when divided by 3,4,5,6, respectively Find all solutions of the linear congruence 3x-7y= 11(mod13) (04)
Step by Step Solution
3.54 Rating (158 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
