Difference between revisions of "1960 AHSME Problems/Problem 10"
Hashtagmath (talk | contribs) (Created page with "== Problem 10== Given the following six statements: <cmath>\text{(1) All women are good drivers}</cmath> <cmath>\text{(2) Some women are good drivers}</cmath> <cmath>\text{(3...") |
m (→Solution) |
||
| (13 intermediate revisions by 4 users not shown) | |||
| Line 20: | Line 20: | ||
| − | [[ | + | ==Solution== |
| + | <math>\fbox{(E)5}</math> | ||
| + | |||
| + | If you look at (5) and (6), if either one of them are false, it implies that the other one is true and vice versa≥ | ||
| + | also haiyaaaa hwy u no know solve it treeveal cheevian. @dhar | ||
| + | |||
| + | ==See Also== | ||
| + | {{AHSME 40p box|year=1960|num-b=9|num-a=11}} | ||
| + | |||
| + | [[Category:Introductory Logic Problems]] | ||
Latest revision as of 17:49, 20 November 2024
Problem 10
Given the following six statements:
![\[\text{(1) All women are good drivers}\]](http://latex.artofproblemsolving.com/8/b/4/8b4895c70b5a5f213fc788dd36282abdda113eea.png)
![\[\text{(2) Some women are good drivers}\]](http://latex.artofproblemsolving.com/f/c/e/fce78ab7dbf59f07001747415c05eaca07fadc28.png)
![\[\text{(3) No men are good drivers}\]](http://latex.artofproblemsolving.com/8/f/9/8f923abd2a1e882968ae2eb896bdc580c3a9eca5.png)
![\[\text{(4) All men are bad drivers}\]](http://latex.artofproblemsolving.com/8/7/2/8724677501bea949fc6bce4ee0f9aa2a7373ed79.png)
![\[\text{(5) At least one man is a bad driver}\]](http://latex.artofproblemsolving.com/d/2/7/d279104945e6078b816bf516d1019ae80b675cf2.png)
![\[\text{(6) All men are good drivers.}\]](http://latex.artofproblemsolving.com/6/c/6/6c65b733bfc10fbd17953d943eaf7ac7c2e4f3a6.png)
The statement that negates statement 
is:
Solution
If you look at (5) and (6), if either one of them are false, it implies that the other one is true and vice versa≥ also haiyaaaa hwy u no know solve it treeveal cheevian. @dhar
See Also
| 1960 AHSC (Problems • Answer Key • Resources) | ||
| Preceded by Problem 9 |
Followed by Problem 11 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 • 40 | ||
| All AHSME Problems and Solutions | ||
