Find all School-related info fast with the new School-Specific MBA Forum

It is currently 18 Jun 2013, 23:55
Customize  |  Hide

Set W= how many integers are there such that they are

  Question banks Downloads My Bookmarks Reviews  
Author Message
TAGS:
SVP
SVP
User avatar
Joined: 03 Feb 2003
Posts: 1680
Followers: 4

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

Set W= how many integers are there such that they are [#permalink] New post 17 Aug 2003, 10:39
Set W=[100, 101, 102, .... ,1000]
how many integers are there such that they are divisible by 3, but not by 5?
Manager
Manager
Joined: 14 Aug 2003
Posts: 90
Location: barcelona
Followers: 1

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

 [#permalink] New post 17 Aug 2003, 10:50
there are 999/3=333 numbers div by 3 between 1 and 1000... there are 99/3=33 numbers div by 3 between 1 and 100... thus there are 300 numbers div by 3 between 100 and 1000... now we have to substract the numbers div by both 3 and 5, ie, div by 15... there are 990/15-90/15=60 such numbers... so answer is 300-60=240?
Manager
Manager
User avatar
Joined: 28 Feb 2003
Posts: 147
Location: Kiev
Followers: 1

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

 [#permalink] New post 18 Aug 2003, 00:57
We have a set of 900 integers (1000-100). Therefore, we meet an integer that is divisible by 3, 900/3=300 times.

Then, if we look at an array of the integers divisible by 3 {102, [b]105[/b], 108, 111, 114, 117, [b]120[/b], 123, 126, 129, 132, [b]135[/b]} we can see that each fifth integer is divisible by 5.

Hence, the number of integers divisible by 5 is 300/5=60

Therefore, the number of integers divisible by 3, but not by 5 is 300-60=[b]240[/b]

stolyar, what do you think?
Manager
Manager
Joined: 10 Jun 2003
Posts: 216
Location: Maryland
Followers: 2

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

GMAT Tests User
Answer change [#permalink] New post 18 Aug 2003, 06:34
bono wrote:
We have a set of 900 integers (1000-100). Therefore, we meet an integer that is divisible by 3, 900/3=300 times.

Then, if we look at an array of the integers divisible by 3 {102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135} we can see that each fifth integer is divisible by 5.

Hence, the number of integers divisible by 5 is 300/5=60

Therefore, the number of integers divisible by 3, but not by 5 is 300-60=240

stolyar, what do you think?


I like the answer and explanation - I would like to change mine to match yours!
Answer change   [#permalink] 18 Aug 2003, 06:34
    Similar topics Author Replies Last post
Similar
Topics:
New posts How many sets containing 10 positive digits (integers from 1 kevincan 6 08 Jul 2006, 00:11
New posts How many different subsets are there of the set of integers GMATT73 4 19 Aug 2006, 23:42
New posts Experts publish their posts in the topic Set S consists of 20 different positive integers. How many axl169 7 10 Oct 2006, 09:04
New posts How many sets of two or more consecutive integers are there kevincan 6 06 Mar 2007, 05:02
New posts Experts publish their posts in the topic How many integers n are there such that v<n<w? BN1989 3 14 Mar 2012, 06:13
Display posts from previous: Sort by

Set W= how many integers are there such that they are

  Question banks Downloads My Bookmarks Reviews  


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

Powered by phpBB © phpBB Group and phpBB SEO

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