Can u guys help me please
1 answer:
You might be interested in
Step-by-step explanation:
To show that a statement is a tautology using truth table - is to show that all the entries in the expression are truths T.
We can do this by taking each statement, expression by expression. For example, to show that
[~p ∧ (p ∨ q)] → q
is a tautology, knowing we have 3 columns, we have 2^3 = 8 rows. We start by putting putting truth values for p, q, and r respectively
Next, we find ~p, then find (p ∨ q), then find ~p ∧ (p ∨ q), before finally arriving at the required [~p ∧ (p ∨ q)] → q
TERMINOLOGIES AND SYMBOLS
- T means Truth
- F means False
- ~p means negation of p.
~p is F if p is T, and vice versa
- ∧ means conjunction.
p ∧ q is T only if p is T and q is T.
- ∨ means disjunction.
p ∨ q is T if either p or q is T.
- → is for conditional 'if then'
p → q is T if both p and q are T, or both p and q are F, or p is F and q is T, otherwise, it is F.
THE STEP BY STEP WORKINGS FOR THE STATEMENTS GIVEN ARE IN THE ATTACHMENT.
Answer:
Step-by-step explanation:
We are given 2 fractions.
1st fraction is Negative StartFraction 3 over 8
i.e.
2nd fraction is negative one-fourth
i.e.
We have to find the quotient when 1st fraction is divided by 2nd fraction.
<u>Definition</u> of quotient is given as:
Quotient is the result obtained when one number is divided by other number.
is converted to
and the 2nd fraction is reversed i.e.
if the fraction is it becomes
and the sign
is changed to
.
Solving above:
So, the quotient is .