Home > College Algebra calculators > Modulo example

2. Modulo example ( Enter your problem )
  1. Example-1 : `3^302 mod 5`
  2. Example-2 : `19^24 mod 21`
  3. Example-3 : `7^106 mod 143`
  4. Example-4 : `27^400 mod 619`
Other related methods
  1. Chinese Remainder Theorem
  2. Modulo
  3. Fast modular exponentiation
  4. Fermat's Little Theorem
  5. Extended Euclidean Algorithm
  6. Euclid's Algorithm
  7. Modular multiplicative inverse

1. Chinese Remainder Theorem
(Previous method)
2. Example-2 : `19^24 mod 21`
(Next example)

1. Example-1 : `3^302 mod 5`





1. 3^302 mod 5 using Modulo

Solution:
`3^302" mod "5`

Here `3^302=(3^2)^151`

`=(3^2" mod "5)^151" mod "5`

`=(9" mod "5)^151" mod "5`

`=4^151" mod "5`

Here `4^151=(4^2)^75*4`

`=(((4^2" mod "5)^75" mod "5)*(4" mod "5))" mod "5`

`=(((16" mod "5)^75" mod "5)*4)" mod "5`

`=((1^75" mod "5)*4)" mod "5`

`=((1" mod "5)*4)" mod "5`

`=(1*4)" mod "5`

`=4" mod "5`

`=4`




This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



1. Chinese Remainder Theorem
(Previous method)
2. Example-2 : `19^24 mod 21`
(Next example)





Share this solution or page with your friends.
 
 
Copyright © 2025. All rights reserved. Terms, Privacy
 
 

.