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. /Let S = {1, 2, 3, 4, 5, 6}, the faces of a die…
AdvancedMathematicsHigh School (11–12)Mathematical ReasoningNumerical

Let S = {1, 2, 3, 4, 5, 6}, the faces of a die…

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.

Let S={1,2,3,4,5,6}S = \{1, 2, 3, 4, 5, 6\}S={1,2,3,4,5,6}, the faces of a die. Decide the truth value of each statement, with xxx and yyy in SSS:

  • A: ∀x ∃y (x+y=7)\forall x\ \exists y\ (x + y = 7)∀x ∃y (x+y=7);
  • B: ∃y ∀x (x+y≤7)\exists y\ \forall x\ (x + y \le 7)∃y ∀x (x+y≤7);
  • C: ∀x ∀y (x+y≤11)\forall x\ \forall y\ (x + y \le 11)∀x ∀y (x+y≤11);
  • D: ∃x ∀y (xy≥y)\exists x\ \forall y\ (xy \ge y)∃x ∀y (xy≥y).

How many of the four are true? Write the negation of C, and count the pairs (x,y)(x, y)(x,y) of SSS that make the negation 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. A. For each xxx in SSS, y=7−xy = 7 - xy=7−x is also in SSS. True.

Step 2. B. Take y=1y = 1y=1. Then x+1≤7x + 1 \le 7x+1≤7 for every x≤6x \le 6x≤6. True.

Step 3. C. x=6x = 6x=6 and y=6y = 6y=6 give 12>1112 > 1112>11. False.

Step 4. D. Take x=1x = 1x=1. Then 1×y≥y1 \times y \ge y1×y≥y for every yyy. True.

Step 5. Count. A, B and D are true: 333 statements.

Step 6. The negation of C. ∃x ∃y (x+y>11)\exists x\ \exists y\ (x + y > 11)∃x ∃y (x+y>11). The only pair is (6,6)(6, 6)(6,6), so 111 pair.

Check. In B the order matters: one yyy must work for all xxx. In A each xxx gets its own yyy.

Answer: 333 statements are true, and 111 pair makes the negation of C true.

Log in to save this for later
← All Problems
← A class of 30 students fills in a survey…Consider the claim "for every real number x, x² > x"… →
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 →