#11
|
|||
|
|||
Re: Math people I need some help with this
maybe you shouldn't skip it?
|
#12
|
|||
|
|||
Re: Math people I need some help with this
[ QUOTE ]
Write the negation of the statements given below. 1.) Everyone cooks broccoli. [/ QUOTE ] Is there more than one way to do this? My inclination (I managed to take not a single solitary math course in college...boy are those standardized place out tests misleading...) Would be to say "Some people don't cook broccoli." But could you also simply say, "Not everyone cooks broccoli."? --Zetack |
#13
|
|||
|
|||
Re: Math people I need some help with this
Broccoli isn't always cooked. [img]/images/graemlins/smile.gif[/img]
|
#14
|
|||
|
|||
Re: Math people I need some help with this
As long as you didn't get tricked into saying "No one cooks broccoli" you probably got it right.
|
#15
|
|||
|
|||
Re: Math people I need some help with this
[ QUOTE ]
It actually isn't my home work I'm a math major trying to skip finite mathematics. [/ QUOTE ] I always thought "finite mathematics" meant algebra and elementary number theory. Is that wrong? These questions are about symbolic logic. |
#16
|
|||
|
|||
Re: Math people I need some help with this
I'm bored at work so I'm going to do them. (and it must be past the due date by now (and if I can't get all of these I need to kill myself).)
[ QUOTE ] Write the negation of the statements given below. 1.) Everyone cooks broccoli. someone doesn't cook broccoli. 2.) No one cooks rhubarb. someone cooks rhubarb. 3.) Everyone eats spinach. someone doesn't eat spinach. 4.) Write the following compound statement in symbolic form. Let p: Today is Monday. q: Tomorrow is the day Norm leaves. If tomorrow is not the day Norm leaves, then today is Monday. -q -> p 5.) Write the following compound statement in symbolic form. Let p: Today is Wednesday. q: Tomorrow is Andrea’s piano lesson. If today is Wednesday, then tomorrow is not Andrea’s piano lesson. p -> -q Construct a truth table for the following statements. 6.) ~ p <-> q p -p q f t -q t f 7.) ~ (P v Q) p -p q f f -q f t 8.) p <-> q p -p q t f -q f t Use DeMorgan’s laws or truth tables to determine whether the following statements are equivalent. 9.) ~(~P^Q)and Pv~Q yes 10.) ~(~Pv~Q)and ~P^Q no 11.) ~(~Pv~Q)and P^Q yes Use the following conditional statement to complete the problems below. If a creature has eight legs, then it is an arachnid. 8 -> arach [positive] 12.) Write the converse of the above conditional statement. arach -> 8 13.) Write the inverse of the above conditional statement. -8 -> -arach 14.) Write the contrapositive of the above conditional statement. -arach -> -8 Determine whether the argument is valid or invalid. You may want to use Euler circles to help. 15.) If a tree produces oxygen, then it has green leaves. If a tree is healthy, then it has green leaves. If a tree produces oxygen, then is has green leaves. yes, but... 16.) If a person kills game, then the person has a weapon. A person does not kill game or the person does not have a weapon. no A person has a weapon and the person does not kill game. yes 17.) All cats have fleas. Rex is a cat. Rex has fleas. yes 18.) Some A are B. All C are A. Some C are B. no Thanks in advance for anyone who can help me [/ QUOTE ] good luck as a "math major". have you thought of applying to business school? I think you'd make an excellent candidate. |
|
|