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
52
Answer
Answers can only be viewed under the following conditions:
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
1.7K
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- answered
- 1451 views
- $4.50
Related Questions
- Discrete Math- Number of factor trees of a graph
- Fix any errors in my proof (beginnner)
- [Discrete Mathematics] For {1,3,6,10,15,…}. Find a recursive formula.
- Fix any errors in my proof (beginner)
- Fix any errors in my proof (beginner)
- Fix any errors in my proof (beginner)
-
Math Proofs: "An alternative notation is sometimes used for the union or intersection of an indexed family of sets."
- Critique my proof (beginner)