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. /Best and worst pairings
MathematicsMediumHigh School (11–12)Inequalities and the AM, GM and HM Means

Best and worst pairings

You will check the rearrangement inequality by computer: the sorted pairings against every possible pairing.

The idea. Sorting both lists the same way gives the largest sum of products, and sorting them in opposite ways gives the smallest. The module itertools can list every order of a list with permutations.

Your tasks.

  1. Finish same_order(a, b). Sort both lists in increasing order and return the sum of products.
  2. Finish opposite_order(a, b). Sort a increasing and b decreasing.
  3. Finish all_totals(a, b). Return a list with the sum of products for every order of b, with a as it is.

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, try lists with negative numbers, such as [-3, 1, 2] and [-1, 4, 0]. Does the largest total still come from the sorted pairing?

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
← Testing Cauchy-SchwarzConvexity on a grid →
More onInequalities and the AM, GM and HM Means

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Rearrangement and Chebyshev's inequalityCauchy-Schwarz, Rearrangement and Chebyshev

More labs on this topic

  1. The point that minimises total distanceMedium
  2. Convexity on a gridMedium
  3. Testing Cauchy-SchwarzMedium
  4. Least values by search and by AM-GMMedium
Three means and their orderMedium
All labs on this topic →