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. /For each whole number n from 1 to 50, consider the statement S(n): "if n is a multiple of 6, then n…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumerical

For each whole number n from 1 to 50, consider the statement S(n): "if n is a multiple of 6, then n…

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.

For each whole number nnn from 111 to 505050, consider the statement S(n)S(n)S(n): "if nnn is a multiple of 666, then nnn is a multiple of 444". For how many values of nnn is S(n)S(n)S(n) false, that is, for how many is the negation ∼S(n)\sim S(n)∼S(n) true? Write the negation in words. Next, consider T(n)T(n)T(n): "nnn is a multiple of 666 if and only if nnn is a multiple of 444". For how many values of nnn from 111 to 505050 is T(n)T(n)T(n) false?

Check your answer

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

Need a reminder? The key ideaShowHide

p⇒qp \Rightarrow qp⇒q is false only when ppp is true and qqq is false, and p⇒q≡∼p∨qp \Rightarrow q \equiv \sim p \vee qp⇒q≡∼p∨q. 'ppp only if qqq' means p⇒qp \Rightarrow qp⇒q. ∼(p⇒q)≡p∧∼q\sim(p \Rightarrow q) \equiv p \wedge \sim q∼(p⇒q)≡p∧∼q. p⇔qp \Leftrightarrow qp⇔q is true when ppp and qqq agree.

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 negation in words. ∼S(n)\sim S(n)∼S(n): "nnn is a multiple of 666 and nnn is not a multiple of 444".

Step 2. Count for S. A multiple of 666 is a multiple of 444 exactly when it is a multiple of 121212. Multiples of 666 up to 505050: 888 of them. Multiples of 121212: 12,24,36,4812, 24, 36, 4812,24,36,48, that is 444. So S(n)S(n)S(n) is false for 8−4=48 - 4 = 48−4=4 values: 6,18,30,426, 18, 30, 426,18,30,42.

Step 3. Count for T. T(n)T(n)T(n) fails when exactly one part holds. Multiples of 666 but not of 444: 444 values. Multiples of 444 but not of 666: there are 121212 multiples of 444, minus the 444 multiples of 121212, giving 888. In all 4+8=124 + 8 = 124+8=12 values.

Check. n=8n = 8n=8: the left part of TTT is F and the right part is T, so T(8)T(8)T(8) is false. S(8)S(8)S(8) is true, since its hypothesis is false.

Answer: S(n)S(n)S(n) is false for 444 values and T(n)T(n)T(n) for 121212.

Log in to save this for later
← All Problems
← Prove, with the laws of logic, that p ⇒ (q ⇒ r) ≡ (p wedge q) ⇒ r…Take the statement "if a quadrilateral is a square, then its diagonals are equal in length"… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Conditional and biconditional statementsConditionals, 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
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 →