All categories

3 years ago

A conditional statement and it's_______ must always have the same truth value.

1 answer:

5 0

Answer: C) Contrapositive

The original conditional is in the form "If P, then Q"
The contrapositive is in the form "If not Q, then not P"
You flip the order of P and Q, and you also negate each piece. The original conditional and contrapositive can be proven to have the same truth values through the use of a truth table.

You might be interested in

The heights of a group of boys and girls at a local middle school are shown on the dot plots below. 2 dot plots with number line

atroni [7]

Answer:sushi love sushi sushi is life and life is sushi

Step-by-step explanation:

8 0

3 years ago

Is this relation a function yes or no ?

andrew-mc [135]

Answer:

Yes

Step-by-step explanation:

None of the x's repeat

6 0

2 years ago

What number is between 3.16 and 3.17?

VladimirAG [237]

There are multiple answers to this question
Answers: 3.161, 3.162, 3.163, 3.164, 3.165, 3.166, 3.167, 3.168, 3.169
(You can just pick one)

Reason: just look at the place numbers. The number has to be between 3.16 and 3.17. So go to the next place value which is the thousandths place. 3.161-3.169 all are between since they have a 6 in the hundredths place, but does not go over 1.17

4 0

3 years ago

Please i really need help

boyakko [2]

Answer:ummmmmmmmm

Step-by-step explanation:

i can't read ittt

3 0

3 years ago

An NFL coach sometimes uses a defense that utilizes 3 defensive linemen, 4 linebackers, and 4 defensive backs. His roster (the p

Alexandra [31]

Answer:

68,600

Step-by-step explanation:

The order of the players is not important. For example, a defensive line of Shaq Lawson, Ed Oliver and Jerry Hughes is the same as a defensive line of Ed Oliver, Shaq Lawson and Jerry Hughes. So we use the combinations formula to solve this question.

Combinations formula:

$C_{n,x}$ is the number of different combinations of x objects from a set of n elements, given by the following formula.

$C_{n,x} = \frac{n!}{x!(n-x)!}$

Defensive Lineman:

3 from a set of 8. So

$C_{8,3} = \frac{8!}{3!5!} = 56$

56 combinations of defensive lineman

Linebackers:

4 from a set of 7. So

$C_{7,4} = \frac{7!}{4!3!} = 35$

35 combinations of linebackers

Defensive backs:

4 from a set of 7. So

$C_{7,4} = \frac{7!}{4!3!} = 35$

35 combinations of defensive backs

How many different ways can the coach pick the 11 players to implement this particular defense?

56*35*35 = 68,600

68,600 different ways can the coach pick the 11 players to implement this particular defense

7 0

3 years ago