Abstract Algebra 44: A factoring fact related to the RSA cryptography algorithm

Abstract Algebra 44: A factoring fact related to the RSA cryptography algorithm Abstract: If a is an integer that is at least 2, then a-1 divides evenly into a^n-1 for any positive integer n. We give an explanation of this factoring fact. We will later use this fact when giving a partial explanation of why the RSA public key cryptography system works. This video accompanies the class "Introduction to Abstract Algebra" at Colorado State University: https://www.math.colostate.edu/~adams/teaching/math366spr2021/