Negate: There exists integer Q s.t. for all x>0 there exists integer k>0 s.t. ...

[Thedoctorsbowtie]

Negate: There exists integer Q s.t. for all x>0 there exists integer k>0 s.t. ...

Hello guys, Can you help me with that please? I have an exam tomorrow:

---

Exercise 1.5.7. Negate the following:

There exists an integer Q such that, for all real numbers x > 0, there exists a positive integer k such that ln(Q - x) > 5 and that, if x < k, then Q is cacophanous.

(The last term used in this exercise is meaningless.)

---

G3121 cihazımdan Tapatalk kullanılarak gönderildi

 

[Deleted member 4993]

Hello guys, Can you help me with that please? I have an exam tomorrow

---

Exercise 1.5.7. Negate the following:

There exists an integer Q such that, for all real numbers x > 0, there exists a positive integer k such that ln(Q - x) > 5 and that, if x < k, then Q is cacophanous.

(The last term used in this exercise is meaningless.)

---

G3121 cihazımdan Tapatalk kullanılarak gönderildi

Exactly where are you stuck?

 

[Dr.Peterson]

Hello guys, Can you help me with that please? I have an exam tomorrow

Here is the negated statement:

It is not true that there exists an integer Q such that for all real numbers x > 0, there exists a positive integer k such that ln(Q - x) > 5 and that if x ≤ k then Q is cacophonous.

Of course, this can be rewritten in a more direct manner, which is probably what you are expected to do.

What have you learned about negating statements with quantifiers? What have you tried in this case?

 

[Thedoctorsbowtie]

Exactly where are you stuck?

This should be negated using quantifiers and symbols. The whole sentence first should be written with quantifiers,Where I am stuck.

G3121 cihazımdan Tapatalk kullanılarak gönderildi