360 views
4 votes
4 votes

178 mod 47 =4

how do we calculate such huge values

1 Answer

Best answer
3 votes
3 votes

We can calculate this value using property of exponentiation in modular arithmetic

$If \ a \equiv b(modN), then\ a^{k} \equiv b^{k}(modN) \ for \ any \ positive \ integer$ k

$17^{8}(mod47) \\ \equiv (17^{2})^{4}(mod47) \\ \equiv 7^{4}(mod)47 \ \because 289mod47=7 \\ \equiv (7^{2})^{2}(mod47) \\ \equiv 2^{2}(mod47) \ \because \ 49mod47=2 \\ \equiv 4(mod47) \\ \equiv 4$

selected by

Related questions

1 votes
1 votes
1 answer
1
Fida asked Dec 10, 2018
1,826 views
How to calculateMod of a big number in RSALike 5 raise to power 13 mod 77
2 votes
2 votes
0 answers
2
Rohit Gupta 8 asked Jan 14, 2018
1,495 views
Solve for x :(103*x) mod 360 = 1.Please explain how to solve this step by step.The answer is 7.
3 votes
3 votes
0 answers
3
A_i_$_h asked Oct 21, 2017
277 views
517 mod 55when power is prime what is the method to solve
0 votes
0 votes
0 answers
4