AoPSWiki
Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.

1983 AIME Problems/Problem 6

From AoPSWiki

Revision as of 21:38, 1 March 2009 by Eshen (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

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
Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us