To determine the remainder when 2120 is divided by 7 , we can use Fermat's Little Theorem. Fermat's Little Theorem states that if p is a prime number and a is an integer not divisible by p, then: ap−1≡1(bmod‌p) In this problem, a=2 and p=7. According to Fermat's Little Theorem: 27−1≡1(bmod‌7) or 26≡1(bmod‌7) This tells us that every sixth power of 2 is congruent to 1 modulo 7. Therefore, we can express 2120 as a multiple of 6 : 2120=(26)20 Since 26≡1(bmod‌7), we can write: (26)20≡120(bmod‌7) This simplifies to: 120≡1(bmod‌7) Thus, the remainder when 2120 is divided by 7 is 1 .