Prove that the sum of a) two, b) several numbers with a fixed product is minimised when the numbers are equal.*
Problem:
Prove that the sum of a) two, b) several numbers, given that their product is constant, is minimised when all the numbers are equal.
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →