It is currently 20 Nov 2017, 12:25

### GMAT Club Daily Prep

#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# What is the remainder when 7^n + 2 is divided by 5 (1) when

Author Message
Senior Manager
Joined: 29 Aug 2005
Posts: 272

Kudos [?]: 70 [0], given: 0

What is the remainder when 7^n + 2 is divided by 5 (1) when [#permalink]

### Show Tags

19 Jun 2008, 04:51
1
This post was
BOOKMARKED
00:00

Difficulty:

(N/A)

Question Stats:

100% (00:10) correct 0% (00:00) wrong based on 3 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

What is the remainder when 7^n + 2 is divided by 5
(1) when n is divided by 4, the remainder is 1
(2) when n is divided by 3, the remainder is 2

just wanted to confirm if this solution method is optimal
using statement 1
In case of 7^n the unit digit circles as 7,9,3,1
And in each case the unit digit of 7^n would be 7 only, which means 9 will be the unit digit, so in each case remainder is 4
using statement 2
In case of 7^n the unit digit circles as 7,9,3,1
And in each case the unit digit of 7^n can vary and we cannot pin point what is the remainder because multiple values are possible.
Therefore A is sufficient
_________________

The world is continuous, but the mind is discrete

Kudos [?]: 70 [0], given: 0

Senior Manager
Joined: 12 Apr 2008
Posts: 499

Kudos [?]: 250 [0], given: 4

Location: Eastern Europe
Schools: Oxford

### Show Tags

19 Jun 2008, 15:22
Quote:
What is the remainder when 7^n + 2 is divided by 5
(1) when n is divided by 4, the remainder is 1
(2) when n is divided by 3, the remainder is 2

I think this approach should work – I mean to study the periodicity of unit digits depending on n. And you are right, the answer is A.

This is more generalised and detailed explanation, just for clarity's sake:

Let’s first examine 7^n+2:
n=0 => 3 => remainder 3
n=1 => 9 => remainder 4
n=2 => 1 => remainder 1
n=3 => 5 => remainder 0
n=4 => 3 => remainder 3

In general:
n=4k => remainder 3
n=4k+1 => remainder 4
n=4k+2 => remainder 1
n=4k+3 => remainder 0

So periodicity with which n gives us different remainders is 4.

Now, first statement gives us that n=4k+1 => we can find the remainder. Thus, suff.

Second statement says that n=3l+2, but this can’t help us, since only representing n as of 4*smth + smth would provide us with unambiguous value for the remainder. So insuff.

As for more efficient solution – I’d like to know it too

Kudos [?]: 250 [0], given: 4

Director
Joined: 01 Jan 2008
Posts: 617

Kudos [?]: 203 [0], given: 1

### Show Tags

19 Jun 2008, 18:09
vdhawan1 wrote:
What is the remainder when 7^n + 2 is divided by 5
(1) when n is divided by 4, the remainder is 1
(2) when n is divided by 3, the remainder is 2

1) n = 4*k+1, k = 0,1,2,3
(7^n+2)(5)=(7*7^4k+2)(5)=(2*49^(2k)+2)(5)=(2*(-1)^2k+2)(5)=4(5) -> suff

2) n = 3*k+2 //k = 0,1,2
(7^n+2)(5) = (49*7^3k+2)(5)=((-1)*(-1)*7^k+2)(5)=(7^k+2)(5) = (2^k+2)(5)
k=0 -> remainder = 3
k=1 -> remainder = 4 -> insufficient

Kudos [?]: 203 [0], given: 1

Re: DS question   [#permalink] 19 Jun 2008, 18:09
Display posts from previous: Sort by