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

It is currently 20 Aug 2018, 19:13

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

A necklace is made by stringing N individual beads together

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

Hide Tags

GMAT Club Legend
GMAT Club Legend
User avatar
B
Joined: 29 Jan 2005
Posts: 5092
A necklace is made by stringing N individual beads together  [#permalink]

Show Tags

New post 02 Nov 2006, 07:41
4
1
13
00:00
A
B
C
D
E

Difficulty:

  15% (low)

Question Stats:

72% (00:55) correct 28% (00:51) wrong based on 333 sessions

HideShow timer Statistics

A necklace is made by stringing N individual beads together in the repeating pattern red bead, green bead, white bead, blue bead, and yellow bead. If the necklace design begins with a red bead and ends with a white bead, then N could equal

A. 16
B. 32
C. 41
D. 54
E. 68
Most Helpful Community Reply
Director
Director
avatar
Joined: 13 Nov 2003
Posts: 778
Location: BULGARIA
  [#permalink]

Show Tags

New post 02 Nov 2006, 07:57
5
The number of beads should fulfill N=5*K+3 .
Seems like E
General Discussion
SVP
SVP
User avatar
Joined: 24 Aug 2006
Posts: 2096
Re: PS Series  [#permalink]

Show Tags

New post 02 Nov 2006, 07:57
2
2
GMATT73 wrote:
A necklace is made by stringing N individual beads together in the repeating pattern red, green, white, blue and yellow. If the necklace begins with a red bead and ends with a white bead, then N could equal...

a. 16
b. 32
c. 41
d. 54
e. 68


there are 5 colors that repeat. so total beads=5k(number of repeated beads)+3(red, green, white)

basically, we have to find a number that is 3 more than a multiple of 5.

e.68 is the only number 65+3=68
CEO
CEO
User avatar
B
Joined: 17 Nov 2007
Posts: 3484
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
GMAT ToolKit User Premium Member CAT Tests
Re: PS - probability  [#permalink]

Show Tags

New post 18 Jan 2008, 11:55
3
1
E

20-sec way.

we should find the reminder of n divisible by 5

red bead - 1
green bead - 2
white bead - 3
blue bead - 4
yellow bead - 0

only 68 has reminder 3.
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Director
Director
User avatar
Joined: 12 Jul 2007
Posts: 853
Re: PS - probability  [#permalink]

Show Tags

New post 18 Jan 2008, 12:35
3
1
Here's how the necklace looks when it is strung:

RED-GREEN-WHITE-BLUE-YELLOW

We know that the length of the pattern is 5 beads (shown above). The necklace begins at the red bead and then ends in a white bead. The shortest necklace we could have would be RED-GREEN-WHITE, which would only be 3 beads and then fit the bill. The next shortest necklace we could have would be when the pattern of 5 beads has been repeated again. In other words (3+5=8 beads) In this case the pattern would loop once (5 beads), then start RED(6)-GREEN(7)-WHITE(8).

The pattern that emerges here is that the number of beads will be in this list:

3
3+5 = 8
3+5+5 = 13
3+5+5+5 = 18
etc

Any easier way of writing this pattern would be to say that the number of beads must be divisible by 5 with 3 left over. or, when the number is divided by 5 it has a remainder of 3. Then we move onto our choices:

16/5 = 3 remainder 1
32/5 = 6 remainder 2
41/5 = 8 remainder 1
54/5 = 10 remainder 4
68/5 = 13 remainder 3

BINGO! We see that 68 is our answer.

an even shorter method would be to realize that the number must end in 3 or 8 because multiples of 5 end in 0 or 5. Thus, the only choice that ends in 3 or 8 would be our answer!

Answer E
VP
VP
avatar
Joined: 28 Dec 2005
Posts: 1477
Re: PS - probability  [#permalink]

Show Tags

New post 18 Jan 2008, 19:14
Recognize that we are going to have to look for an answer thats a multiple of 5, plus 3.

Mutliple of 5 because there are 5 beads in the pattern, and plus 3 because the bead ends on white, which is 3 into the pattern.

I just went through all the answer choices, and only E fits. 5x13 = 65, and 65+3=68
SVP
SVP
avatar
Joined: 04 May 2006
Posts: 1773
Schools: CBS, Kellogg
Premium Member
Re: PS - probability  [#permalink]

Show Tags

New post 18 Jan 2008, 20:26
walker wrote:
E

20-sec way.

we should find the reminder of n divisible by 5

red bead - 1
green bead - 2
white bead - 3
blue bead - 4
yellow bead - 0

only 68 has reminder 3.


Walker, why it is not multiple of 8? I reason that it is multiple of 8 and I choose A and B, but bewteen A and B I can not decide which one? keke
_________________

GMAT Club Premium Membership - big benefits and savings

CEO
CEO
User avatar
B
Joined: 17 Nov 2007
Posts: 3484
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
GMAT ToolKit User Premium Member CAT Tests
Re: PS - probability  [#permalink]

Show Tags

New post 18 Jan 2008, 23:16
sondenso wrote:
walker wrote:
E

20-sec way.

we should find the reminder of n divisible by 5

red bead - 1
green bead - 2
white bead - 3
blue bead - 4
yellow bead - 0

only 68 has reminder 3.


Walker, why it is not multiple of 8? I reason that it is multiple of 8 and I choose A and B, but bewteen A and B I can not decide which one? keke


I cannot write more in 20 sec :-D
Indeed, eschn3am give us a good explanation.
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Manager
Manager
avatar
Joined: 17 Jul 2010
Posts: 117
Re:  [#permalink]

Show Tags

New post 01 May 2013, 19:06
2
GMATT73 wrote:
There must a simple equation to aplly here, just need a little help setting it up. Counting by brute force is a time waster!


A fast way without heavy calculations is to look at the answers and subtract 3 from the answer, and find if its a multiple of 5. Only option that fits this criteria is E.
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 48067
Re: A necklace is made by stringing N individual beads together  [#permalink]

Show Tags

New post 02 May 2013, 04:09
GMATT73 wrote:
A necklace is made by stringing N individual beads together in the repeating pattern red bead, green bead, white bead, blue bead, and yellow bead. If the necklace design begins with a red bead and ends with a white bead, then N could equal

A. 16
B. 32
C. 41
D. 54
E. 68


Similar question to practice: 12-easy-pieces-or-not-126366.html#p1033936
_________________

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

Intern
Intern
avatar
B
Joined: 26 Jun 2017
Posts: 8
Re: A necklace is made by stringing N individual beads together  [#permalink]

Show Tags

New post 17 Sep 2017, 09:06
Hi all

May i know what kind of this question is? I've been looking for some typical questions like the one above to solve.

Thanks
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 48067
Re: A necklace is made by stringing N individual beads together  [#permalink]

Show Tags

New post 17 Sep 2017, 09:29
tringuyenminh293 wrote:
Hi all

May i know what kind of this question is? I've been looking for some typical questions like the one above to solve.

Thanks


Basically this is a remainders question (check tags above the first post).

Similar question to practice: https://gmatclub.com/forum/12-easy-piec ... l#p1033936
_________________

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

EMPOWERgmat Instructor
User avatar
V
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 12217
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: A necklace is made by stringing N individual beads together  [#permalink]

Show Tags

New post 22 Mar 2018, 10:41
Hi All,

These types of "repeating sequence" questions tend to be easy to beat IF you draw a picture. We're given the repeating sequence of beads: RGWBY…RGWBY…

We're asked if a string starts with R and ends with W, then the total number of beads COULD be. The phrase "could be" is important because it means that there's more than one correct answer. We have to work until we find the correct answer that's listed OR we deduce the pattern.

Following the given rules, at the minimum, we'd have…

RGW = 3 beads

That answer's not there, so keep going with the pattern:

RGWBY
RGW = 8 beads

That answer's not there either, so keep going:

RGWBY
RGWBY
RGW = 13 beads

Now, that answer isn't there either, but we now KNOW the pattern. The total increases by 5 each time, and the correct answer will end in either a 3 or an 8. There's only one answer that fits this pattern...

Final Answer:

GMAT assassins aren't born, they're made,
Rich
_________________

760+: Learn What GMAT Assassins Do to Score at the Highest Levels
Contact Rich at: Rich.C@empowergmat.com

Rich Cohen

Co-Founder & GMAT Assassin

Special Offer: Save $75 + GMAT Club Tests Free
  Official GMAT Exam Packs + 70 Pt. Improvement Guarantee
www.empowergmat.com/

***********************Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!***********************

Intern
Intern
avatar
B
Joined: 02 Oct 2016
Posts: 25
Reviews Badge
Re: A necklace is made by stringing N individual beads together  [#permalink]

Show Tags

New post 08 Apr 2018, 07:08
1
there are 5 colors that repeat. so total beads=5k(number of repeated beads)+3(red, green, white)

basically, we have to find a number that is 3 more than a multiple of 5.

e.68 is the only number 65+3=68
Re: A necklace is made by stringing N individual beads together &nbs [#permalink] 08 Apr 2018, 07:08
Display posts from previous: Sort by

A necklace is made by stringing N individual beads together

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

Events & Promotions

PREV
NEXT


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®.