This topic contains 2 replies, has 2 voices, and was last updated by admin 3 weeks, 4 days ago.
Viewing 3 posts - 1 through 3 (of 3 total)
Viewing 3 posts - 1 through 3 (of 3 total)
Understanding Math Beyond the Classroom
by
How it Works › Forums › Introductory Problems (AMC 8 Problems 10-20) › Foundations of NT
This topic contains 2 replies, has 2 voices, and was last updated by admin 3 weeks, 4 days ago.
Here are 3 introductory problems (AMC 8 Problems 10-15), along with a CHALLENGE PROBLEM relating to the Foundations of NT. As always, each question adds 10 points to your leaderboard score, but the challenge problem adds 15 points!
1. What is the units digit of $2^{100}$?
2. Find the remainder when $2015^{2015}$ is divided by $14$?
3. If $p$, $q$, and $r$, are primes such that $7(p+q+r) = pqr$, then find $p$, $q$, and $r$.
CHALLENGE PROBLEM:
The two-digit integers form $19$ to $92$ are written consecutively to form the large integer
$N = 192021 · · · 909192$.
Suppose that $3^k$ is the highest power of $3$ that is a factor of $N$. What is $k$?
As always, you can post any questions you have in the Questions forum.
1.
The pattern of the units digit for powers of 2 is “2,4,8,6”, for example: 2^1=2, 2^2=4, 2^3=8, 2^4=16, 2^5=32, 2^6=64, etc.
So then we just follow the pattern till we get to 2^100 which will be with a units digit of 6.
Good work Surya! You have been awarded 10 points! But, to further your understanding, how do you know that the “pattern” will continue. In other words, why doesn’t it go 2,4,8,6,2,4,8,6,3,5,…? How can we use modular arithmetic specifically to justify our answer more clearly?