OpenStax, Prealgebra 2e §9.2 Solve Money Applications · Exercise 16 · Algebra · Algebra word problems

Solve Money Applications · Exercise 16

Solve the ticket and stamp word problems.

If the number of $\$ \text{8} $c hi l d t i c k e t s i sse v e n t ee n l ess t han t h r ee t im es t h e n u mb er o f$ $\text{12} $a d u l tt i c k e t s an d t h e t h e a t er t oo k in$ $\text{584},$ how many of each ticket were sold?

Its source prints no answer for this problem, so there's nothing to check against.

~5 minWritten answer · compare with the solution

OpenStax, Prealgebra 2e · §9.2 Solve Money Applications · Exercise 16

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your working

Check your full solution

Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.