Author 
Message 
TAGS:

Hide Tags

GMAT Club Legend
Joined: 29 Jan 2005
Posts: 5092

A necklace is made by stringing N individual beads together
[#permalink]
Show Tags
02 Nov 2006, 07:41
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
Official Answer and Stats are available only to registered users. Register/ Login.




Director
Joined: 13 Nov 2003
Posts: 778
Location: BULGARIA

The number of beads should fulfill N=5*K+3 .
Seems like E




SVP
Joined: 24 Aug 2006
Posts: 2096

Re: PS Series
[#permalink]
Show Tags
02 Nov 2006, 07:57
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
Joined: 17 Nov 2007
Posts: 3484
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth)  Class of 2011

Re: PS  probability
[#permalink]
Show Tags
18 Jan 2008, 11:55
E20sec 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 musthave app especially if you aim at 700+  PrepGame



Director
Joined: 12 Jul 2007
Posts: 853

Re: PS  probability
[#permalink]
Show Tags
18 Jan 2008, 12:35
Here's how the necklace looks when it is strung:
REDGREENWHITEBLUEYELLOW
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 REDGREENWHITE, 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
Joined: 28 Dec 2005
Posts: 1477

Re: PS  probability
[#permalink]
Show Tags
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
Joined: 04 May 2006
Posts: 1773
Schools: CBS, Kellogg

Re: PS  probability
[#permalink]
Show Tags
18 Jan 2008, 20:26
walker wrote: E
20sec 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
Joined: 17 Nov 2007
Posts: 3484
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth)  Class of 2011

Re: PS  probability
[#permalink]
Show Tags
18 Jan 2008, 23:16
sondenso wrote: walker wrote: E
20sec 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 Indeed, eschn3am give us a good explanation.
_________________
HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android)  The OFFICIAL GMAT CLUB PREP APP, a musthave app especially if you aim at 700+  PrepGame



Manager
Joined: 17 Jul 2010
Posts: 117

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
Joined: 02 Sep 2009
Posts: 48067

Re: A necklace is made by stringing N individual beads together
[#permalink]
Show Tags
02 May 2013, 04:09



Intern
Joined: 26 Jun 2017
Posts: 8

Re: A necklace is made by stringing N individual beads together
[#permalink]
Show Tags
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
Joined: 02 Sep 2009
Posts: 48067

Re: A necklace is made by stringing N individual beads together
[#permalink]
Show Tags
17 Sep 2017, 09:29



EMPOWERgmat Instructor
Status: GMAT Assassin/CoFounder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 12217
Location: United States (CA)

Re: A necklace is made by stringing N individual beads together
[#permalink]
Show Tags
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
CoFounder & 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
Joined: 02 Oct 2016
Posts: 25

Re: A necklace is made by stringing N individual beads together
[#permalink]
Show Tags
08 Apr 2018, 07:08
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






