234k views
5 votes
true or false? the following is a valid proof of the theorem that for every integer n, there is an integer k such that n < k < n 2. assume n is an integer. let k be an integer such that n < k < n 2. this shows that for every n, an integer k such that n < k < n 2 exists. group of answer choices true false

User Cbehanna
by
7.8k points

1 Answer

7 votes

Answer:

False

Explanation:

This isn't a valid proof since you've used the statement you're trying to prove in your argument which you can't do,

User Toris
by
8.7k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.