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

|Activities| |Contact| |Front page| |Contents| |Geometry|

Copyright © 1996-2018 Alexander Bogomolny

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

Euclid offered an lagorithm for finding N^th 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 BB₁, B₁B₂, ..., B_N-1B_N. Join B_N to C and through the rest of points B draw the lines parallel to B_NC. They will cross BC in the points dividing BC into N equal parts.

• How to divide a segment into n equal parts
• Al-Nayrizi's Construction
• Besteman's Construction
• Besteman Construction II
• Dividing a Segment by Paper Folding
• Euclid's Segment Division
• The GLaD Construction
• The SaRD Construction
• Similar Right Triangles
• Divide Triangle by Lines Parallel to Base

|Activities| |Contact| |Front page| |Contents| |Geometry|

Copyright © 1996-2018 Alexander Bogomolny