title: How can we compute modular arithmetic with large divisor and exponent?
body: <p>Example:</p>
  
  <p>(30000000^30000000) mod 40000000 = ?</p>
  
  <p>I have been using Euler theory and properties of exponents but still cannot get the answer
  Anyone know how to calculate this by just theories and simple calculator?</p>
  
  <p>My trial is to reduce the exponent of the 30000000 by the Fermat's Little Theorem but the exponent is still too large for the calculator to compute.</p>