course Mth 151 ΣģqwȨassignment #001
......!!!!!!!!...................................
19:17:14 3.2.6 ~(p^q) false; truth values of components
......!!!!!!!!...................................
RESPONSE --> they both must be true, to be false confidence assessment: 1
.................................................
......!!!!!!!!...................................
19:30:50 **~p ^ ~q is false because ~q is false. One false is fatal to a conjunction. ~q is false so both parts of the disjunction [(~p^~q) U ~q] are false. Thus [(~p^~q) U ~q] is false. The negation ~[(~p^~q) U ~q] of this statement is therefore true.**
......!!!!!!!!...................................
RESPONSE --> ~p^~q is false ~q is false ~[(~p^~q) U ~q] is true self critique assessment: 2
.................................................
......!!!!!!!!...................................
19:41:15 3.2.36 p: 15<8 q: 9 not > 5 r: 18 <= 18 evaluate -(p U -q) U -r
......!!!!!!!!...................................
RESPONSE --> p: false q: false r: true -(pU -q) is true -r is false -(p U -q) U -r is true confidence assessment: 0
.................................................
......!!!!!!!!...................................
19:57:12 ** If you just have two statements p and q, then there are four possible truth values: TT, TF, FT and FF. If you have three statements p, q and r then there are eight possible truth values: TTT, TTF, TFT, TFF, and FTT, FTF, FFT, FFF. Note that the number of possible truth values doubles every time you add a statement. The number of truth values for 2 statements is 4, which is 2^2. For 3 statements this doubles to 8, which is 2^3. Every added statement doubles the number, which adds a power to 2. From this we see that the number of possible truth values for n statements is 2^n. For the 8 statements listed for this problem, there are therefore 2^8 =256 possible truth values. **
......!!!!!!!!...................................
RESPONSE --> ? self critique assessment: 0
.................................................
......!!!!!!!!...................................
21:00:21 ** For column headings p q ~p ~q ~p^~q ~p U q (~p^~q) U (~p Uq) the first row would start off T T, for p and for q. Then F F for ~p and ~q. Then F for ~p ^ ~q, then T for ~p V q, then T for the final column. So the first row would be T T F F F T T. The second row would be T F F T F F F The third row would be F T T F F T T and the fourth row would be F F T T T T T **
......!!!!!!!!...................................
RESPONSE --> p q (-p^-q) U (~pUq) T T F F F T T T F F T F F F F T T F F T T F F T T T T T self critique assessment: 2
.................................................
......!!!!!!!!...................................
21:25:40 3.2.68 (formerly 3.2.66) This wasn't assigned but is similar to other assigned problems so you should be able to solve it: Negate the following statement using De Morgan's Law: ' F.C. tried to sell the wine but was unable to do so'.
......!!!!!!!!...................................
RESPONSE --> F.C. TRIED TO SELL WINE, BUT HE WAS UNABLE TO DO SO. : F.C. DIDNT TRIED TO SELL ANY WINE, BUT DID SO ANYWAYS confidence assessment: 2
.................................................
......!!!!!!!!...................................
21:27:00 3.2.81 is the statement 3 + 1 = 6 xor 2 + 5 = 7 true or false?
......!!!!!!!!...................................
RESPONSE --> TRUE confidence assessment: 2
.................................................
wєaԃw{ assignment #013 013. `query 13 College Algebra 10-29-2007 Zp{kJ^I assignment #014 014. `query 14 College Algebra 10-29-2007
......!!!!!!!!...................................
21:05:20 3.3.5 rewrite using if then ' all marines love boot camp '.
......!!!!!!!!...................................
RESPONSE --> Equivalent to: If its a marine, it loves boot camp. confidence assessment: 2
.................................................
......!!!!!!!!...................................
21:06:50 3.3.18 ~p false q false p -> q true
......!!!!!!!!...................................
RESPONSE --> ~p is False, q is False, p->q is False, p is True confidence assessment: 2
.................................................
......!!!!!!!!...................................
21:08:25 Query 3.3.36 write in symbols 'If we don't bike, then it does not rain.'
......!!!!!!!!...................................
RESPONSE --> p is :don't ride bike r is :it rain confidence assessment: 2
.................................................
......!!!!!!!!...................................
21:09:35 Query 3.3.48 q true, p and r false, evaluate and (-r U p) -> p
......!!!!!!!!...................................
RESPONSE --> (~r u p )(t) confidence assessment: 1
.................................................
......!!!!!!!!...................................
21:12:31 Query 3.3.60 truth table for (p ^ q) -> (p U q)
......!!!!!!!!...................................
RESPONSE --> p q (p^q) (p u q) (p^q)->(p u q) T T T T T T F F T T F T F T T F F F F T confidence assessment: 3
.................................................
......!!!!!!!!...................................
21:13:35 Query 3.3.74 (formerly 3.3.72). This wasn't assigned but it is similar to assigned questions and should be answered: What is the negation of the statement 'if loving you is wrong then I don't want to be right' ?
......!!!!!!!!...................................
RESPONSE --> Loving you is wrong and I want to be right. confidence assessment: 3
.................................................
You then start the process over with the next question, clicking on the Next Question/Solution button at top left, etc. &#