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. Python Labs
  2. /A counterexample hunter
MathematicsEasyHigh School (11–12)Mathematical Reasoning

A counterexample hunter

You will write a small tool that tests a claim about whole numbers and reports the first counterexample.

The idea. A claim "for every nnn from start to stop, P(n)P(n)P(n)" fails at the first nnn with P(n)P(n)P(n) false. A search can find a counterexample, but it can never prove a claim about every whole number.

Your tasks.

  1. Finish is_prime(n). Return True for a prime and False otherwise (also for 000 and 111).
  2. Finish first_counterexample(P, start, stop). Return the first nnn in range(start, stop) with P(n) false, or None if there is none.
  3. Set euler to the first counterexample of "n2+n+41n^2 + n + 41n2+n+41 is prime" for nnn from 000 to 999999.

Run it first, just as it is. The checker at the end prints FAIL for each task. Then do the tasks one at a time, and run the program again after each one. A Hint appears under every check that still fails.

When every line says PASS, test "2n+12^n + 12n+1 is prime" for nnn from 111 to 202020. Which nnn is the first counterexample?

StemPy LabContributed by StemPy Lab
python
Loading Python runtime…

A worked solution

Run your code once to unlock the worked solution.

Have you tried it?

Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.

Log in to save
← All Labs
← An argument checkerNext →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Direct proof, contrapositive and counterexampleValid Arguments and Methods of Proof

More labs on this topic

  1. An argument checkerEasy
  2. A checker for for-all and there-existsEasy
  3. Four related conditionalsEasy
  4. A tester for laws and circuitsEasy
A truth table makerEasy
All labs on this topic →