Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
May 1212:00 PM EDT
-11:59 PM EDT
Make the most of your break with the most realistic GMAT™ prep. Take up to $700 off select products.
May 1308:30 AM PDT
-09:30 AM PDT
In Episode 4 of our GMAT Ninja CR series, we tackle the most intimidating CR question type: Boldface & "Legalese" questions. If you've ever stared at an answer choice that reads, "The first is a consideration introduced to counter a position that...- May 14
08:30 AM PDT
-09:30 AM PDT
Most GMAT test-takers are intimidated by the hardest GMAT Verbal questions. In this session, Target Test Prep GMAT instructor Erika Tyler-John, a 100th percentile GMAT scorer, will show you how top scorers break down challenging Verbal questions..
29 Jul 2013, 14:52
Kudos
Bookmarks
Hey Guys,
I have been having difficulty with converting problems into a logical boolean sentence in order to solve them. In the problem below I am not so much concerned with finding the answer but writing out the sentence in order to find the solution. Maybe if there is a guide/book/etc. that can help me out with this subject.
For example: How many numbers between 1 and 1000 are divisible by 2 and 3?
Let A=total amount of numbers divisible by 2 between 1 and 1000
B=total amount of numbers divisible by 3 between 1 and 1000
T=total amount of numbers between 1 and 1000
So AnB=A+B-AuB
1) How many numbers between 1 and 1000 are not divisible by 2 and 3?
~(AnB)=~Au~B (Demorgan's Law)=~A+~B-(~An~B)
could we also write ~(AnB)=T-(AnB)
OR is this question asking ~An~B which does not equal ~(AnB)
~An~B
2) How many numbers between 1 and 1000 are divisible by 2 but not divisible by 3?
An~B=A+B-(Au~B)
3) How many numbers between 1 and 1000 are divisible by either 2 or 3?
AuB=A+B-AnB
4) How many numbers between 1 and 1000 are divisible by neither 2 or 3?
~(AuB)=T-(AuB)
where AuB=A+B-AnB
I have been having difficulty with converting problems into a logical boolean sentence in order to solve them. In the problem below I am not so much concerned with finding the answer but writing out the sentence in order to find the solution. Maybe if there is a guide/book/etc. that can help me out with this subject.
For example: How many numbers between 1 and 1000 are divisible by 2 and 3?
Let A=total amount of numbers divisible by 2 between 1 and 1000
B=total amount of numbers divisible by 3 between 1 and 1000
T=total amount of numbers between 1 and 1000
So AnB=A+B-AuB
1) How many numbers between 1 and 1000 are not divisible by 2 and 3?
~(AnB)=~Au~B (Demorgan's Law)=~A+~B-(~An~B)
could we also write ~(AnB)=T-(AnB)
OR is this question asking ~An~B which does not equal ~(AnB)
~An~B
2) How many numbers between 1 and 1000 are divisible by 2 but not divisible by 3?
An~B=A+B-(Au~B)
3) How many numbers between 1 and 1000 are divisible by either 2 or 3?
AuB=A+B-AnB
4) How many numbers between 1 and 1000 are divisible by neither 2 or 3?
~(AuB)=T-(AuB)
where AuB=A+B-AnB
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
05 Aug 2013, 20:50
Kudos
Bookmarks
Can anyone please take a crack at the setence structure. I would really appreciate your advice.
Posted from my mobile device
Posted from my mobile device
20 Aug 2013, 19:28
Kudos
Bookmarks
I would really appreciate someones help please. This is extremely relevant to the gmat.
