AoPSWiki
Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.
Personal tools

1983 AIME Problems/Problem 6

From AoPSWiki

Problem

Let a_n equal 6^{n}+8^{n}. Determine the remainder upon dividing a_ {83} by 49.

Contents

Solution

Solution 1

First, we try to find a relationship between the numbers we're provided with and 49. We realize that 49=7^2 and both 6 and 8 greater or less than 7 by 1.

Expressing the numbers in terms of 7, we get (7-1)^{83}+(7+1)^{83}.

Applying the Binomial Theorem, half of our terms cancel out and we are left with 2(7^{83}+3403\cdot7^{81}+\cdots + 83\cdot7). We realize that all of these terms are divisible by 49 except the final term.

After some quick division, our answer is \boxed{035}.

Solution 2

Since \phi(49) = 42 (the Euler's totient function), by Euler's Totient Theorem, a^{42} \equiv 1 \pmod{49} where \text{gcd}(a,49) = 1. Thus 6^{83} + 8^{83} \equiv 6^{2(42)-1}+8^{2(42)-1} \equiv 6^{-1} + 8^{-1} \equiv \frac{8+6}{48} \equiv \frac{14}{-1}\equiv \boxed{035} \pmod{49}.

See also

1983 AIME (ProblemsResources)
Preceded by
Problem 5
Followed by
Problem 7
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us