If the universe of disclosure is set of integers, then which of the followings are TRUE?

(A) ∀n ∃m(n2 < m)

(B) ∃n ∀m(n < m2)

(C) ∃n ∀m(nm = m)

(D) ∃n ∃m(n2 + m2 = 6)

(E) ∃n ∃m(n + m = 4 ∧ n - m = 1)

Choose the correct answer from the options given below:

This question was previously asked in
UGC NET Computer Science (Paper 2) 07 Dec 2023 Official Paper
View all UGC NET Papers >
  1. (A), (B) and (C) Only
  2. (B) and (C) Only
  3. (C), (D) and (E) Only
  4. (C) and (E) Only

Answer (Detailed Solution Below)

Option 1 : (A), (B) and (C) Only
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
16.4 K Users
50 Questions 100 Marks 60 Mins

Detailed Solution

Download Solution PDF

The correct answer is: Option 1) (A), (B), and (C) only

Key Points

Given: Universe of discourse = Integers

(A) ∀n ∃m (n² < m)
For every integer n, there exists an integer m such that n² < m.
✔️ Since integers are unbounded above, for any n², we can find m = n² + 1 (or higher).
TRUE

(B) ∃n ∀m (n < m²)
There exists an integer n such that for every integer m, n < m².
✔️ Try n = -1. Since m² ≥ 0 for all integers m, -1 < m² always holds true.
TRUE

(C) ∃n ∀m (n·m = m)
There exists an integer n such that for all m, n·m = m.
✔️ Try n = 1. Then 1·m = m for all m.
TRUE

(D) ∃n ∃m (n² + m² = 6)
Check all integer combinations:
n = 1, m = 2 → 1² + 2² = 1 + 4 = 5 ❌
n = 2, m = 2 → 4 + 4 = 8 ❌
No integer solution satisfies n² + m² = 6.
FALSE

(E) ∃n ∃m (n + m = 4 ∧ n - m = 1)
Solving:
n + m = 4
n - m = 1
⇒ 2n = 5 ⇒ n = 2.5, m = 1.5
 Not integers ⇒ no integer solution ❌ FALSE

Final Conclusion:
Only statements (A), (B), and (C) are TRUE.
Correct Answer: Option 1

Latest UGC NET Updates

Last updated on Jul 21, 2025

-> The UGC NET Final Answer Key 2025 June has been released by NTA on its official website.

-> The UGC NET June 2025 Result has been released on the official website ugcnet.nta.ac.in on 22nd July 2025.

-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.

-> The UGC NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Mathematical Logic Questions

Get Free Access Now
Hot Links: teen patti 51 bonus teen patti gold old version teen patti jodi teen patti comfun card online dhani teen patti