A number when divided by 3 gives a remainder of 1. How many distinct

Question

A number when divided by 3 gives a remainder of 1. How many distinct values can the remainder take when the same number is divided by 9?

A) 1
B) 2
C) 3
D) 4
E) 5

doomedcat · Answer

let N=3p+1 ; Given number when divided by 3 gives a remainder of 1
now we want to know distinct values of remainder when N is divided by 9

So we check for diff values of p=0,1,2,3,4....

N= 3(0) + 1 = 1; 1/9 gives remainder as 1
N= 3(1) + 1 = 4; 4/9 gives remainder as 4
N= 3(2) + 1 = 7; 7/9 gives remainder as 7
N= 3(3) + 1 = 10; 10/9 gives remainder as 1

this is where cycle starts ; lets check one more to confirm
N= 3(4) + 1 = 13; 13/9 gives remainder as 4
.
.
.

So we now know N will give 3 distinct remainders when divided by 9

Ans C

Archit3110 · Answer

for the given condition the number would be 1,4,7 and remainders would be in same sequence 
similarly when divided by 9 ; we get same sequence ; 
option C is valid

Nups1324 · Answer

Bunuel , chetan2u , yashikaaggarwal , nick1816 , IanStewart , GMATinsight , ScottTargetTestPrep , fskilnik . Hi all, The cyclicity of the remainder is 1,4,7 when divided by 3. So can this question be solved by a shortcut using the divisibility properties of 3 and 9 or any of the factors and multiple rules.? For example, if the cyclicity of the remainder when divided by 3 is 1,4,7 then it will be the same when divided by 9 as well since 9 is the multiple of 3 or 3 is a factor of 9. Thank you.

Posted from my mobile device

chetan2u · Answer

I won’t call 1, 4 and 7 to be cyclicity of remainder but it will surely get you the answer. 
The number is 3x+1, and as 3 is a factor of 9, all positive integer values of 3x+1 less than 9 will be the remainder when divided by 9.

IanStewart · Answer

I'm not quite sure what you mean by this. When we divide by 3, the only possible remainders are 0, 1 and 2, so it isn't possible for 4 or 7 to be a remainder when we divide by 3. It's true that if a number has a remainder of 1 when divided by 3, that number will give a remainder of 1, 4 or 7 when divided by 9, and that's all you need to observe to answer the intended question.

There's a problem with the wording of the question though:

The question is talking about a specific number. A specific number can only have one remainder when you divide it by 9; we don't need any other information to answer that question. They mean instead to talk about numbers generally that produce a remainder of 1 when divided by 3. Then there are three possible remainders when you divide by 9.

yashikaaggarwal · Answer

the no. when is divisible by 3 is leaving remainder 1, while dividing by 9 is leaving remainder 1,4,7 on cyclicity ( we did divide those no. with 9 to know the cyclicity)
Instead we can say that, 1)   if a no. n is leaving any constant remainder, its square will leave remainder equal to the values for which n is leaving constant remainder till the no. less than n^2   or 
2)   the square of no. n will leave same distinct values after every n no.   
for ex, let say 5 leaves remainder 1 when divided by no. 1,6,11,16,21,26,31................................
its square 25 will leave remainder = 1,6,11,16,21 till the no. less than 25 (21, because 26 is bigger than 25) and then after 21, the cyclicity will continue from 1,6,11,16,21. (after every 5th term) (same as in question where cyclicity is repeating after every 3rd digit)

Your method is correct but using cyclicity word can be dangerous, for instance in highlighted word one can easily interpret that the remainder of a no. when divided by 3 is 1,4,and 7 but its the no. which is leaving remainder 1. the sentence can be ambiguous there, Instead we can use the above stated lines.

TestPrepUnlimited · Answer

Let the number be represented by  3i + 1 . We can note the remainder when divided by 9 does cycle as  3i + 1  can be incremented by multiples of 9's. We can see 9/3 = 3 so every 3 numbers we will return to the original remainder. To use numbers, we can have 4, 7, 10, 13 as possible numbers but when we divide by 9 the remainders can only be 1, 4, 7, thus three possible remainders.

Ans: C

Nups1324 · Answer

Hi, I'm extremely sorry. I used the wrong word twice. What I wanted to say was that the "dividend" has a "space/progression" of 3 between them when divided by 3 with a remainder of 1. Dividend = Quotient × Divisor + Remainder 1,4,7,10,13... has a space of 3. I misused the word cyclicity for space. Then I used these number in the above mentioned formula to find the cyclicity of 1,4,7 as remainder for these specific numbers when divided by 9. So I concluded that 1,4,7 are the 3 distinct remainder as the quotient is the same for these numbers when divided by 9 but the remainder is different. Sorry for the confusing. Secondly,I got your methods as well. Thank you dear experts. chetan2u , IanStewart , yashikaaggarwal . Thank you.

Gauriii · Answer

@chetan2u- Dear Chetan Sir, I got till the step that number will be of the form 3q+1.
But what after that? How are we procedding after it? Thanks in advance.

lakshya14 · Answer

Why 4/9 is not 5? Giving us more remainders.

bumpbot · Answer

Automated notice from GMAT Club BumpBot: 

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

 This post was generated automatically.

A number when divided by 3 gives a remainder of 1. How many distinct

Prep Toolkit

Top 5 GMAT Debrief Videos

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards

GMAT Problem Solving (PS) Questions

A number when divided by 3 gives a remainder of 1. How many distinct

Prep Toolkit

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards