# Discrete Structures - Proving a statement false by proving the negation to be true

I am already sure that the original statement in the image is false, however, it needs to be proven by showing that the negation is true

Because of the domain, only integers can be used if plugged in

Adilling3654

52

## Answer

**Answers can be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

Alessandro Iraci

1.6K

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.

- answered
- 318 views
- $4.50

### Related Questions

- [Discrete Mathematics] Induction
- Count the number of decks of cards, where no king is on top of the ace of the same suit.
- Sinusodial graph help (electrical)
- Proof through inclusion (A∆B) ∪ A = A ∪ B
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- Logic Question ¬¬𝐴→𝐴
- Logic Question (𝐴→(𝐵→𝐶))→((𝐴→𝐵)→(𝐴→𝐶))
- Five times the larger of two consecutive odd integers is equal to one more than eight times the smaller. Find the integers.