Last visit was: 20 Nov 2025, 02:43 It is currently 20 Nov 2025, 02:43
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
Close
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
Your Progress

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
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
Back to Forum
Create Topic
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 20 Nov 2025
Posts: 105,408
Own Kudos:
778,453
 [25]
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,408
Kudos: 778,453
 [25]
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + + 9 12 Jun 2015, 03:05
4
Kudos
Add Kudos
21
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

55% (hard)

Question Stats:

63% (02:15) correct 37% (02:24) wrong based on 601 sessions

History

Date
Time
Result
Not Attempted Yet
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9^n, what is the remainder when y is divided by 5?

(1) n is divisible by 3.
(2) n is odd
ShowHide Answer
Official Answer
B
Most Helpful Reply
User avatar
GMATinsight
User avatar
Major Poster
Joined: 08 Jul 2010
Last visit: 19 Nov 2025
Posts: 6,842
Own Kudos:
16,354
 [10]
Given Kudos: 128
Status:GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator
Location: India
GMAT: QUANT+DI EXPERT
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
WE:Education (Education)
Products:
My Reviews
Expert
Expert reply
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
Posts: 6,842
Kudos: 16,354
 [10]
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + + 9 12 Jun 2015, 03:48
5
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
Bunuel
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9^n, what is the remainder when y is divided by 5?

(1) n is divisible by 3.
(2) n is odd


Kudos for a correct solution.
Show more


CONCEPT : The ramainder when any number is divided by 5 is the remainder when the unit digit of the Number is divided by 5 therefore such questions require the calculation of the Unit digit of the number (y in this case) only

Question Redefined: y = 9^0 + 9^1 + 9^2 + … + 9^n

Statement 1: n is divisible by 3

@n=3, y = 9^0 + 9^1 + 9^2 + 9^3 = Unit digits are [ 1 + 9 + 1 + 9] = Unit digit of the numbers 0 i.e. Remainder 0 when y is divided by 5
@n=6, y = 9^0 + 9^1 + 9^2 +---+ 9^6 = Unit digits are [ 1 + 9 + 1 + 9 + 1+ 9 + 1] = Unit digit of the numbers 1 i.e. Remainder 1 when y is divided by 5

Hence, NOT SUFFICIENT

Statement 2: n is odd

@n=3, y = 9^0 + 9^1 + 9^2 + 9^3 = Unit digits are [ 1 + 9 + 1 + 9] = Unit digit of the numbers 0 i.e. Remainder 0 when y is divided by 5
@n=5, y = 9^0 + 9^1 + 9^2 + 9^3 + 9^4 + 9^5 = Unit digits are [ 1 + 9 + 1 + 9 + 1 + 9] = Unit digit of the numbers 0 i.e. Remainder 0 when y is divided by 5

with the above working, we can observe that y will always have even number of terms for every odd value of n as the minimum power starts from 0 in each terms.

Also every pair of two consecutive terms in y gives us 0 Unit digit i.e. sum of all pairs of terms in y becomes 0 and the remainder when y is divided by 5 will also become 0

Hence, SUFFICIENT

Answer: option
Show Spoiler
B
General Discussion
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 20 Nov 2025
Posts: 105,408
Own Kudos:
778,453
 [2]
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,408
Kudos: 778,453
 [2]
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + + 9 15 Jun 2015, 05:29
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Bunuel
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9^n, what is the remainder when y is divided by 5?

(1) n is divisible by 3.
(2) n is odd


Kudos for a correct solution.
Show more

MANHATTAN GMAT OFFICIAL SOLUTION:

Remember the units digit pattern for 9^x, where x is an integer. The units digit of 9^x is 9 if x is odd, but the units digit is 1 if x is even: a repeating pattern of [9,1].

Now, consider the sums of the powers of 9 up to 9^n:
Attachment:
2015-06-15_1629.png
2015-06-15_1629.png [ 64.33 KiB | Viewed 9160 times ]
The alternating 1's and 9's in the units digits pair to a sum of 10, or a units digit of 0. Thus, the units digit of the sum displays another two-term repeating pattern. The units digit of y is 0 if n is odd, but 1 if n is even.

The remainder when y is divided by 5 depends only on the units digit and will be either 0 or 1 as well. So the rephrased question is “Is n odd or even?”

(1) INSUFFICIENT: If n is a multiple of 3, it may be either odd or even.

(2) SUFFICIENT: If n is odd, the units digit of y is 0, and the remainder is 0 when y is divided by 5.

The correct answer is B.
User avatar
broall
User avatar
Retired Moderator
Joined: 10 Oct 2016
Last visit: 07 Apr 2021
Posts: 1,138
Own Kudos:
7,150
Given Kudos: 65
Status:Long way to go!
Location: Viet Nam
Posts: 1,138
Kudos: 7,150
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + + 9 03 Dec 2016, 05:19
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9^n, what is the remainder when y is divided by 5?

(1) n is divisible by 3.
(2) n is odd
Show more

\(9 \equiv -1 \pmod{5} \implies 9^k \equiv (-1)^k \pmod{5}\)

(1) \(n=3k\) so

\(\begin{split}
y &\equiv (-1)^0 &+(-1)^1 &+(-1)^2 &+...&+(-1)^{3k} &\pmod{5}\\
y &\equiv \quad 1 &+ (-1) &+\quad 1 &+...&+(-1)^k &\pmod{5}\\
\end{split}\)

If \(k\) is even, for example \(k=2\), then \(y \equiv 1 \pmod{5}\)
If \(k\) is odd, for example \(k=1\), then \(y \equiv 0 \pmod{5}\)

Insufficient.

(2) \(n=2k+1\) so
\(\begin{split}
y &\equiv (-1)^0 &+(-1)^1 &+(-1)^2 &+...&+(-1)^{2k}&+(-1)^{2k+1} &\pmod{5}\\
y &\equiv \quad 1 &+ (-1) &+\quad 1 &+...&+\quad 1 &+(-1) &\pmod{5}\\
y &\equiv \quad 0 &\pmod{5}
\end{split}\)

Sufficient

Hence the answer is B


Other solution
\(y \equiv (-1)^0 +(-1)^1 +(-1)^2 +...+(-1)^{n} = \frac{(-1)^{n+1}-1}{(-1)-1}=\frac{-(-1)^{n}-1}{-2}=\frac{(-1)^n+1}{2}\pmod{5}\)

(1) If \(n=3k \implies y \equiv \frac{(-1)^{3k}+1}{2} \pmod{5}\)
If \(k=1 \implies y \equiv \frac{(-1)^3+1}{2}=0 \pmod{5}\)
If \(k=2 \implies y \equiv \frac{(-1)^6+1}{2}=1 \pmod{5}\)

Hence insufficient.

(2) If \(n=2k+1 \implies y \equiv \frac{(-1)^{2k+1}+1}{2}=\frac{(-1)+1}{2}=0 \pmod{5}\)
Hence sufficient.
User avatar
ShashankDave
User avatar
Joined: 03 Apr 2013
Last visit: 26 Jan 2020
Posts: 218
Own Kudos:
288
 [1]
Given Kudos: 872
Location: India
Concentration: Marketing, Finance
Schools: McDonough '21 (A) Kelley '21 ISB '21 (I)
GMAT 1: 740 Q50 V41
GPA: 3
Schools: McDonough '21 (A) Kelley '21 ISB '21 (I)
GMAT 1: 740 Q50 V41
Posts: 218
Kudos: 288
 [1]
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + + 9 02 Mar 2017, 00:38
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9^n, what is the remainder when y is divided by 5?

(1) n is divisible by 3.
(2) n is odd


Kudos for a correct solution.
Show more

Hi Bunuel...
I used negative remainders for this one...
9 when divided by 5 gives out a remainder of -1.
Lets see this given series by replacing 9 with -1...

\((-1)^0 + (-1)^1 + (-1)^2 +(-1)^3..... +(-1)^n\)

So if n is odd, we will have the sum equal to 0.
And if n is even, we will have the sum equal to 1.

Now let's check the statements..
(1) n could be either odd or even. Not sufficient.
(2) N is odd. Sufficient

Answer (B)
avatar
coolkl
avatar
Joined: 10 Jun 2016
Last visit: 06 Feb 2019
Posts: 31
Own Kudos:
12
Given Kudos: 194
Schools: IIM-A"19
Schools: IIM-A"19
Posts: 31
Kudos: 12
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + + 9 17 Mar 2017, 13:40
Kudos
Add Kudos
Bookmarks
Bookmark this Post
"Y = 1+ 9+9^2... y = 5k + r. R = 0 if we get 0 or 5 as units digit

S-1) n = 3, 6,9..
If we see the sequence if n = 3
1+ 9 + 81+ 729 is div by 5
n = 6 => consider only units digit 1 + 9 + 1 + 9 + 1+ 9 +1 not div by 5.
NS

S-2) Sufficient if n is always odd n = 3,5 as in S-1
If we see the sequence if n = 3
1+ 9 + 81+ 729 is div by 5
"
Answer is B
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,596
Own Kudos:
1,079
Posts: 38,596
Kudos: 1,079
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + + 9 26 Oct 2023, 09:25
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
Moderators:
Bunuel
Math Expert
105408 posts
kingbucky
496 posts