Modulo with larger numbers

[Former user]

There are some rules that allow larger modulos, e.g. the square-and-multiply-method or using Euler-Fermat. When I try to calculcate

mod(211^1043; 10)

I get: "Berechnung wäre zu aufwändig" (calculcating this would be too hard).

This can easily be done by hand when knowing e.g. Euler-Fermat (for some numbers), or more generalized by the square-and-multiply-method ( https://en.wikipedia.org/wiki/Exponentiation_by_squaring ). It would be of great help to add those internally, so that larger numbers can be calculcated easily.