Euler's Theorem: Level 2 Challenges Practice Problems Online

What is the last digit of \( 2^9?\)

For a positive integer \(n>2,\) what can we say about the number of positive integers less than \(n\) that are relatively prime to \(n\) (that is, their GCD is 1)?

Hint: A useful property of the Greatest Common Divisor function is \(\gcd(a,b) = \gcd(a,a-b);\) e.g., \(\gcd(10,8) = \gcd(10,2) = 2.\)

Find the last two digits of \(7^{100}-3^{100}.\)

What is the largest integer that always divides \(n^{7}-n\) for any integer \(n?\)

\[\LARGE \color{blue}5^{\color{green}5^{\color{red}5^{\color{brown}5^\color{magenta}5}}}\]

What are the last three digits of the number above?

Intro

Concept Quizzes

Challenge Quizzes

Euler's Theorem: Level 2 Challenges

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 6 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.

Euler's Theorem