An example of your premise that Most A are C and most B are C, therefore some A are B would be : Most birds (A) can fly (C). Most airplanes (B) can fly (C). Some birds are airplanes (some A are B). You can see that it doesn't work.
The relationship, as explained by @stepharizona288 and @msami1010493 only works if you are talking about two subsets of the same world. (like Most A are B and Most A are C, then some B are C) Most birds can fly. Most birds build nests. Some things that can fly build nests.
Most A are C. So, if we have 10 As, lets say that 6 of them (most) are C (so we have 6 AC, and 4 separate As).
Most B are C. So, if we have 10 Bs, lets say that 6 of them (most) are C (so we have 6 BC, and 4 separate Bs).
Can we come up with a situation where NO As are Bs (thus disproving the A Some B statement)?
Sure we can: Look above. Did we ever link an A to a B? Nope, not a single time.
To piggy back on Stephanie's statement (I think that's your name, @stepharizona288 forgive me if it's not!):
A most B (so, we have 6 AB and 4 separate Bs)
A most C (so, we have 6 AC, and 4 separate Cs)
But wait a minute, if there are only 10 "A" on this planet, we have to at least 2 points of intersection between B and C. To meet the minimum requirement of the two statements above, it would look like this:
AB
AB
AB
AB
ABC
ABC
AC
AC
AC
AC
There's a lesson on Most and Some statements that explains the two terms as they apply to the LSAT incredibly well.
No you can't. Some statements are reversible but Most statements are reversed to some statements.
So some Cs are As and some Bs are Cs but you can't go
B some C some A
To be B some A or A some B.
You can only link 2 mosts when the left side is the same
so
A--m-->B
A--m-->C
--------------------
B-- s --C
Would be a valid conclusion.
2
Topics
PT Questions
Select Preptest
You've discovered a premium feature!
Subscribe to unlock everything that 7Sage has to offer.
Hold on there, stranger! You need a free account for that.
We love that you want to get going. Just create a free account below—it only takes a minute—and then you can continue!
Hold on there, stranger! You need a free account for that.
We love that you came here to read all the amazing posts from our 300,000+ members. They all have accounts too! Just create a free account below—it only takes a minute—and then you’re free to discuss anything!
Hold on there, stranger! You need a free account for that.
We love that you want to give us feedback! Just create a free account below—it only takes a minute—and then you’re free to vote on this!
Hold on there, you need to slow down.
We love that you want post in our discussion forum! Just come back in a bit to post again!
Subscribers can learn all the LSAT secrets.
Happens all the time: now that you've had a taste of the lessons, you just can't stop -- and you don't have to! Click the button.
3 comments
An example of your premise that Most A are C and most B are C, therefore some A are B would be : Most birds (A) can fly (C). Most airplanes (B) can fly (C). Some birds are airplanes (some A are B). You can see that it doesn't work.
The relationship, as explained by @stepharizona288 and @msami1010493 only works if you are talking about two subsets of the same world. (like Most A are B and Most A are C, then some B are C) Most birds can fly. Most birds build nests. Some things that can fly build nests.
+1 @stepharizona288
To solidify it, here's an example:
Most A are C. So, if we have 10 As, lets say that 6 of them (most) are C (so we have 6 AC, and 4 separate As).
Most B are C. So, if we have 10 Bs, lets say that 6 of them (most) are C (so we have 6 BC, and 4 separate Bs).
Can we come up with a situation where NO As are Bs (thus disproving the A Some B statement)?
Sure we can: Look above. Did we ever link an A to a B? Nope, not a single time.
To piggy back on Stephanie's statement (I think that's your name, @stepharizona288 forgive me if it's not!):
A most B (so, we have 6 AB and 4 separate Bs)
A most C (so, we have 6 AC, and 4 separate Cs)
But wait a minute, if there are only 10 "A" on this planet, we have to at least 2 points of intersection between B and C. To meet the minimum requirement of the two statements above, it would look like this:
AB
AB
AB
AB
ABC
ABC
AC
AC
AC
AC
There's a lesson on Most and Some statements that explains the two terms as they apply to the LSAT incredibly well.
No you can't. Some statements are reversible but Most statements are reversed to some statements.
So some Cs are As and some Bs are Cs but you can't go
B some C some A
To be B some A or A some B.
You can only link 2 mosts when the left side is the same
so
A--m-->B
A--m-->C
--------------------
B-- s --C
Would be a valid conclusion.