Sign in

Libre University uses your GitHub account. Signing in is only needed to sit a final test, so the score is kept on your profile.

Statements and connectives

1.[1p]

Which of these is a statement?

Correct
The answer is: $91$ is prime
The answer is: $91$ is prime
The answer is: $91$ is prime

2.[3p]

Match each compound statement to the only circumstances in which it has the stated truth value.

  • ¬P is true

  • P∧Q is true

  • P∨Q is false

  • P⇒Q is false

  • P⟺Q is true

  • only when P and Q are both true

  • exactly when P is false

  • only when P is true and Q is false

  • only when P and Q are both false

  • exactly when P and Q have the same truth value

Show the answer

¬P is true: exactly when P is false P∧Q is true: only when P and Q are both true P∨Q is false: only when P and Q are both false P⇒Q is false: only when P is true and Q is false P⟺Q is true: exactly when P and Q have the same truth value

3.[1p]

The statement "if 2+2=5, then 7 is even" is true.

Correct
The answer is: True

4.[2p]

What is the negation of "x<0 or x>1"?

Correct
The answer is: $x \ge 0$ and $x \le 1$
The answer is: $x \ge 0$ and $x \le 1$
The answer is: $x \ge 0$ and $x \le 1$

5.[2p]

What is the negation of "if n2 is even, then n is even"?

Correct
The answer is: $n^2$ is even and $n$ is odd
The answer is: $n^2$ is even and $n$ is odd
The answer is: $n^2$ is even and $n$ is odd

6.[3p]

Which of these are equivalent to P⇒Q?

Select all that apply

Correct
Correct
Correct
The answer is: $\neg Q \Rightarrow \neg P$, $P$ only if $Q$, $Q$ is a necessary condition for $P$
The answer is: $\neg Q \Rightarrow \neg P$, $P$ only if $Q$, $Q$ is a necessary condition for $P$
The answer is: $\neg Q \Rightarrow \neg P$, $P$ only if $Q$, $Q$ is a necessary condition for $P$

7.[2p]

Take the statement "if n is divisible by 10, then n is divisible by 5". Match each name to the conditional it names.

  • Converse

  • Inverse

  • Contrapositive

  • if n is divisible by 5, then n is divisible by 10

  • if n is not divisible by 5, then n is not divisible by 10

  • if n is not divisible by 10, then n is not divisible by 5

Show the answer

Converse: if n is divisible by 5, then n is divisible by 10 Inverse: if n is not divisible by 10, then n is not divisible by 5 Contrapositive: if n is not divisible by 5, then n is not divisible by 10

8.[1p]

Being divisible by 3 is a sufficient condition for an integer to be divisible by 6.

The answer is: False
Correct

9.[2p]

Put these steps of the argument that a conditional with a false hypothesis must count as true in order.

  1. "For every integer n, if n is divisible by 4, then n is even" is a true theorem.

  2. A claim about every integer is true only if its instance for each integer is true.

  3. So a conditional with a false hypothesis must count as true, whatever its conclusion.

  4. So the instance at n=6, with a false hypothesis and a true conclusion, and the instance at n=7, with both parts false, must both be true.

Show the answer

a, b, c, d