Art of Problem Solving
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

2023 WSMO Team Round Problems/Problem 2: Difference between revisions

Pinkpig (talk | contribs)
Created page with "==Problem== Integers <math>W,S,M,</math> and <math>O</math> satisfy <math>W+S+M+O = 13.</math> Find the maximum possible value of <math>WSMO.</math> ==Solution=="
 
Pinkpig (talk | contribs)
No edit summary
 
Line 4: Line 4:


==Solution==
==Solution==
From the AM-GM inequality, we want <math>W,S,M,O</math> as close to each other as possible. So, let <math>W=S=M=3,O=4\implies WSMO = \boxed{108}.</math>
~pinkpig

Latest revision as of 12:50, 13 September 2025

Problem

Integers $W,S,M,$ and $O$ satisfy $W+S+M+O = 13.$ Find the maximum possible value of $WSMO.$

Solution

From the AM-GM inequality, we want $W,S,M,O$ as close to each other as possible. So, let $W=S=M=3,O=4\implies WSMO = \boxed{108}.$

~pinkpig