2000 PMWC Problems/Problem I10

Revision as of 17:34, 20 April 2014 by TheMaskedMagician (talk | contribs) (Created page with "==Problem== In the sum <math>\frac{a}{b}+\frac{c}{d}</math>, each letter represents a distinct digit from <math>1</math> to <math>9</math>. The sum is as close as possible to <ma...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

In the sum $\frac{a}{b}+\frac{c}{d}$, each letter represents a distinct digit from $1$ to $9$. The sum is as close as possible to $1$ without being greater than or equal to $1$. What is the sum?

Solution

See Also