Algebra · Optimization · Bounding · Fraction manipulation · Monotonicity
Problem 3, 2011
The natural numbers \(m\) and \(n\) satisfy \(19 \leq m \leq 49\) and \(51 \leq n \leq 101\). What is the largest value that
\[ \frac{n + m}{n - m} \]
can take?
- A \(20\)
- B \(30\)
- C \(40\)
- D \(50\)
- E \(60\)
Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.
Slovenian High School Mathematics Competition for Vega Awards (MaSSA), regijsko (regional) round 2011, 1. letnik, category A, problem A3. Organized by DMFA Slovenije (Society of Mathematicians, Physicists and Astronomers of Slovenia). Source