It is currently 22 Sep 2017, 21:06

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

I run into this problem and have no clue what to do and how

  post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
Senior Manager
Senior Manager
User avatar
Joined: 04 Aug 2008
Posts: 374

Kudos [?]: 36 [0], given: 1

I run into this problem and have no clue what to do and how [#permalink]

Show Tags

New post 28 Sep 2008, 16:15
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

I run into this problem and have no clue what to do and how to approach it (if you answer please explain the steps)

For a finite sequence of nonzero numbers, the number of variations in sign is defined as the number of pairs of consecutive terms of the sequence for which the product of the two consecutive terms is negative. What is the number of variations in sign for the sequence 1, -3, 2, 5, -4, -6 ?

one
two
three
four
five
_________________

The one who flies is worthy. The one who is worthy flies. The one who doesn't fly isn't worthy

Kudos [?]: 36 [0], given: 1

Manager
Manager
avatar
Joined: 22 Sep 2008
Posts: 121

Kudos [?]: 48 [0], given: 0

Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 17:43
is answer 1 ?

i am not sure but i solved by taking two random series.

1:1 ,-2 (total 1 negative product 1*-2 & 1 sign change)

2: 1,3,-2 (total 1 negative product ,3*-2 & 1 sign change)

Please confirm it..

Kudos [?]: 48 [0], given: 0

Senior Manager
Senior Manager
User avatar
Joined: 04 Aug 2008
Posts: 374

Kudos [?]: 36 [0], given: 1

Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 18:14
sorry buddy thats not the answer
_________________

The one who flies is worthy. The one who is worthy flies. The one who doesn't fly isn't worthy

Kudos [?]: 36 [0], given: 1

Intern
Intern
avatar
Joined: 26 May 2008
Posts: 8

Kudos [?]: 0 [0], given: 0

Location: Chicago, IL
Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 18:23
is the answer three?

Kudos [?]: 0 [0], given: 0

Intern
Intern
avatar
Joined: 24 Aug 2008
Posts: 8

Kudos [?]: 1 [0], given: 0

Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 18:32
Answer must be 3.

In the sequence 1, -3, 2, 5, -4, -6

This sign changes 3 times ( therefore product of 2 adjacent numbers is negative )

1 to -3
-3 to 2
5 to -4

What's OA ?

Kudos [?]: 1 [0], given: 0

Intern
Intern
avatar
Joined: 17 Aug 2008
Posts: 12

Kudos [?]: 2 [0], given: 0

Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 18:36
For a finite sequence of nonzero numbers, the number of variations in sign is defined as the number of pairs of consecutive terms of the sequence for which the product of the two consecutive terms is negative. What is the number of variations in sign for the sequence 1, -3, 2, 5, -4, -6 ?

one
two
three
four
five

The answer is three:
(1*-3)=-3 negative
(-3*2)=-6 negative
(2*5)=10 positive
(5*-4)=-20 negative
(-4*-6)=24 positive
3 Negative products of consecutive terms

Kudos [?]: 2 [0], given: 0

Intern
Intern
avatar
Joined: 03 Mar 2008
Posts: 46

Kudos [?]: 11 [0], given: 0

Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 18:37
IMO three
OA ?

if correct could expand on my method

Kudos [?]: 11 [0], given: 0

Current Student
avatar
Joined: 28 Dec 2004
Posts: 3354

Kudos [?]: 316 [0], given: 2

Location: New York City
Schools: Wharton'11 HBS'12
Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 19:10
i am going with 3..

the number of sign changes..lets see...1, -3, 2, 5, -4, -6

-1*3=-3 -4*2=-8 -6*2=-12

Kudos [?]: 316 [0], given: 2

Senior Manager
Senior Manager
User avatar
Joined: 04 Aug 2008
Posts: 374

Kudos [?]: 36 [0], given: 1

Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 19:16
OA is three

I also guessed this answer but cannot explain it. Seems like bertlacy comes w logical explanation
_________________

The one who flies is worthy. The one who is worthy flies. The one who doesn't fly isn't worthy

Kudos [?]: 36 [0], given: 1

Manager
Manager
avatar
Joined: 22 Sep 2008
Posts: 121

Kudos [?]: 48 [0], given: 0

Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 21:47
oops.. big blunder by me.. i have not see the series and just start calculating :(

Kudos [?]: 48 [0], given: 0

VP
VP
User avatar
Joined: 05 Jul 2008
Posts: 1403

Kudos [?]: 423 [0], given: 1

Re: Sequence problem - Nightmare [#permalink]

Show Tags

New post 28 Sep 2008, 21:58
bertlacy wrote:
For a finite sequence of nonzero numbers, the number of variations in sign is defined as the number of pairs of consecutive terms of the sequence for which the product of the two consecutive terms is negative. What is the number of variations in sign for the sequence 1, -3, 2, 5, -4, -6 ?

one
two
three
four
five

The answer is three:
(1*-3)=-3 negative
(-3*2)=-6 negative
(2*5)=10 positive
(5*-4)=-20 negative
(-4*-6)=24 positive
3 Negative products of consecutive terms


Agree that 3 is correct.

Kudos [?]: 423 [0], given: 1

Re: Sequence problem - Nightmare   [#permalink] 28 Sep 2008, 21:58
Display posts from previous: Sort by

I run into this problem and have no clue what to do and how

  post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions| 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®.