We propose a class assignment where students are asked to construct and implement an efficient algorithm to calculate the last digits of a positive integral power of a positive integer. The mathematical prerequisites for this assignment are very limited: knowledge of remainder calculus and the binary representation of a positive integer. The periodicity of the last digits is studied by means of the Euler totient function and the Carmichael function.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados