HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /A class of 30 students fills in a survey…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumerical

A class of 30 students fills in a survey…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

A class of 303030 students fills in a survey. 181818 students own a phone, 151515 own a laptop and 888 own both. A teacher claims: "Every student in the class owns a phone or a laptop." Write the negation of the claim in words and in symbols. Use P(x)P(x)P(x) for "xxx owns a phone" and L(x)L(x)L(x) for "xxx owns a laptop". How many students own at least one of the two? How many students are counterexamples to the claim? Which of the claim and its negation is true?

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

∼(∀x P(x))≡∃x ∼P(x)\sim(\forall x\ P(x)) \equiv \exists x\ \sim P(x)∼(∀x P(x))≡∃x ∼P(x) and ∼(∃x P(x))≡∀x ∼P(x)\sim(\exists x\ P(x)) \equiv \forall x\ \sim P(x)∼(∃x P(x))≡∀x ∼P(x). One counterexample disproves a for-all statement. The order of two different quantifiers matters.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. The claim. ∀x (P(x)∨L(x))\forall x\ (P(x) \vee L(x))∀x (P(x)∨L(x)).

Step 2. The negation. ∃x ∼(P(x)∨L(x))≡∃x (∼P(x)∧∼L(x))\exists x\ \sim(P(x) \vee L(x)) \equiv \exists x\ (\sim P(x) \wedge \sim L(x))∃x ∼(P(x)∨L(x))≡∃x (∼P(x)∧∼L(x)). In words: "some student owns neither a phone nor a laptop".

Step 3. At least one. 18+15−8=2518 + 15 - 8 = 2518+15−8=25 students.

Step 4. Counterexamples. 30−25=530 - 25 = 530−25=5 students own neither. Each one is a counterexample.

Step 5. Which is true. One counterexample is enough to make the claim false. So the claim is false and its negation is true.

Answer: 252525 students own at least one; there are 555 counterexamples, so the negation is true.

Log in to save this for later
← All Problems
← You are told only that the statement "if p then q" is false…Let S = {1, 2, 3, 4, 5, 6}, the faces of a die… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Quantifiers and their negationsConditionals, Contrapositives and Quantifiers

More on this topic

  1. Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3…Advanced
  2. Prove by contradiction that there are no integers a and b with 6a + 9b = 100…Advanced
  3. Prove by contradiction that √3 is irrational…Hard
  4. Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…
Advanced
  • The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…Advanced
  • All problems on this topic →