GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 21 Oct 2018, 16:39

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.

Close

Request Expert Reply

Confirm Cancel

n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 50009
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9  [#permalink]

Show Tags

New post 12 Jun 2015, 03:05
1
13
00:00
A
B
C
D
E

Difficulty:

  65% (hard)

Question Stats:

60% (02:15) correct 40% (02:17) wrong based on 294 sessions

HideShow timer Statistics

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.

_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

Most Helpful Expert Reply
CEO
CEO
User avatar
P
Joined: 08 Jul 2010
Posts: 2564
Location: India
GMAT: INSIGHT
WE: Education (Education)
Reviews Badge
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9  [#permalink]

Show Tags

New post 12 Jun 2015, 03:48
5
1
Bunuel wrote:
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.



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
_________________

Prosper!!!
GMATinsight
Bhoopendra Singh and Dr.Sushma Jha
e-mail: info@GMATinsight.com I Call us : +91-9999687183 / 9891333772
Online One-on-One Skype based classes and Classroom Coaching in South and West Delhi
http://www.GMATinsight.com/testimonials.html

ACCESS FREE GMAT TESTS HERE:22 ONLINE FREE (FULL LENGTH) GMAT CAT (PRACTICE TESTS) LINK COLLECTION

General Discussion
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 50009
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9  [#permalink]

Show Tags

New post 15 Jun 2015, 05:29
1
Bunuel wrote:
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.


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 2583 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.
_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

Senior CR Moderator
User avatar
V
Status: Long way to go!
Joined: 10 Oct 2016
Posts: 1381
Location: Viet Nam
GMAT ToolKit User Premium Member
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9  [#permalink]

Show Tags

New post 03 Dec 2016, 05:19
Bunuel wrote:
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


\(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.
_________________

Actual LSAT CR bank by Broall

How to solve quadratic equations - Factor quadratic equations
Factor table with sign: The useful tool to solve polynomial inequalities
Applying AM-GM inequality into finding extreme/absolute value

New Error Log with Timer

Senior Manager
Senior Manager
User avatar
G
Joined: 03 Apr 2013
Posts: 280
Location: India
Concentration: Marketing, Finance
GMAT 1: 740 Q50 V41
GPA: 3
GMAT ToolKit User
n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9  [#permalink]

Show Tags

New post 02 Mar 2017, 00:38
1
Bunuel wrote:
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.


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)
_________________

Spread some love..Like = +1 Kudos :)

Intern
Intern
avatar
S
Joined: 10 Jun 2016
Posts: 49
Schools: IIM-A"19
Re: n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9  [#permalink]

Show Tags

New post 17 Mar 2017, 13:40
"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
_________________

Thank You Very Much,
CoolKl
Success is the Journey from Knowing to Doing

A Kudo is a gesture, to express the effort helped. Thanks for your Kudos.

Non-Human User
User avatar
Joined: 09 Sep 2013
Posts: 8507
Premium Member
Re: n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9  [#permalink]

Show Tags

New post 27 Apr 2018, 12:41
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.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

GMAT Club Bot
Re: n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9 &nbs [#permalink] 27 Apr 2018, 12:41
Display posts from previous: Sort by

n is a positive integer greater than 2. If y = 9^0 + 9^1 + 9^2 + … + 9

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


Copyright

GMAT Club MBA Forum Home| About| Terms and Conditions and Privacy Policy| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.