## Dividing a Segment into N parts:Euclid's Segment Division A Mathematical Droodle: What Is This About?

### This applet requires Sun's Java VM 2 which your browser may perceive as a popup. Which it is not. If you want to see the applet work, visit Sun's website at https://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.

 What if applet does not run?

Explanation

## Dividing a Segment into N parts:Euclid's Segment Division

Euclid offered an lagorithm for finding Nth part of a given segment in Elements VI.9.

### This applet requires Sun's Java VM 2 which your browser may perceive as a popup. Which it is not. If you want to see the applet work, visit Sun's website at https://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.

 What if applet does not run?

Let BC be a given segment to be divided into N equal parts. Draw any line through B at a positive angle to BC. Measure on that line equal segments BB1, B1B2, ..., BN-1BN. Join BN to C and through the rest of points B draw the lines parallel to BNC. They will cross BC in the points dividing BC into N equal parts.