CEMC Fryer, 2005

Algebra Difficulty 1.0 Junior Prove it Canada

Explain why it is impossible for the line segment $AE$ to have 10 sub-segments of lengths $1, 2, 3, 4, 5, 6, 7, 8, 9$ , and $10$ .

Figure for this problem

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.