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 p(n) be the open sentence "n² - 9n + 18 < 0", where n is a whole number from 1 to 12…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumericalBoard Exam

Let p(n) be the open sentence "n² - 9n + 18 < 0", where n is a whole number from 1 to 12…

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 p(n)p(n)p(n) be the open sentence "n2−9n+18<0n^2 - 9n + 18 < 0n2−9n+18<0", where nnn is a whole number from 111 to 121212. Each choice of nnn turns p(n)p(n)p(n) into a statement. For how many of the twelve values is p(n)p(n)p(n) true? For how many is its negation ∼p(n)\sim p(n)∼p(n) true? A student says that the negation is "n2−9n+18>0n^2 - 9n + 18 > 0n2−9n+18>0" and counts the values for which that holds. How many does the student get, and why is the student wrong?

Check your answer

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

Need a reminder? The key ideaShowHide

A statement is true or false, but not both. Questions, commands, opinions and open sentences are not statements. The negation ∼p\sim p∼p is true exactly when ppp is false; the negation of 'x>ax > ax>a' is 'x≤ax \le ax≤a'.

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.

Given. p(n)p(n)p(n): n2−9n+18<0n^2 - 9n + 18 < 0n2−9n+18<0, for n=1,2,…,12n = 1, 2, \dots, 12n=1,2,…,12.

Plan. Factorise, find where the product is negative, then count the rest for the negation.

Step 1. Factorise. n2−9n+18=(n−3)(n−6)n^2 - 9n + 18 = (n - 3)(n - 6)n2−9n+18=(n−3)(n−6).

Step 2. Where it is negative. The product is negative only between the roots, for 3<n<63 < n < 63<n<6. The whole numbers are 444 and 555. So p(n)p(n)p(n) is true for 222 values.

Step 3. The negation. ∼p(n)\sim p(n)∼p(n) is "n2−9n+18≥0n^2 - 9n + 18 \ge 0n2−9n+18≥0". It is true for the other 12−2=1012 - 2 = 1012−2=10 values.

Step 4. The student's count. The product is 000 at n=3n = 3n=3 and n=6n = 6n=6. Leaving these out gives 10−2=810 - 2 = 810−2=8 values.

Watch out. The negation of "less than 000" is "not less than 000", that is, greater than or equal to 000. The student's sentence is false at n=3n = 3n=3, and so is p(3)p(3)p(3). A statement and its negation can never both be false.

Answer: p(n)p(n)p(n) is true for 222 values, ∼p(n)\sim p(n)∼p(n) for 101010, and the student gets 888.

Log in to save this for later
← All Problems
← A school notice board shows six sentences…A thermostat sends a signal while the room temperature t, in degrees Celsius, satisfies "t is… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Statements and their negationsStatements, Connectives and Truth Tables

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 →