Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Learn to enjoy mathematics.
Google
Web CTK
Best sites for teachers
Sites for teachers
Sites for parents
Terms of use
Awards

Interactive Activities
CTK Exchange
CTK Insights - a blog

Games & Puzzles
What Is What
Arithmetic/Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Other Math sites
Front Page
Movie shortcuts
Personal info
Reciprocal links
Privacy Policy

Guest book
News sites

Recommend this site

Best sites for teachers
Sites for teachers
Sites for parents

Education & Parenting

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

Dividing a Segment into N parts:
Besteman Construction II
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 http://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.


Buy this applet

Explanation

Copyright © 1996-2008 Alexander Bogomolny

 

 

 

 

 

 

 

 

Dividing a Segment into N parts:
Besteman Construction II

The applet illustrates an algorithm for dividing a segment in N equal parts found by a college student, Nathan Besteman, and reported in the recent issue of Mathematics Teacher.

 

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 http://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.


Buy this applet

The construction employs a well known property of angle bisectors in a triangle. In ACD, let DP be the angle bisector of angle D. Then

(1)AP/PC = AD/CD

It follows from (1) that if CD = N·AD, then AP = PC/N, or PC = N·AP, so that by adding AP we get AP = AC/(N+1). This suggests an iterative algorithm: for N = 2, there is a known construction of the midpoint B of AC by joining the points of intersection of two circles of equal radii centered at A and C. To trisect AC, reduce the radius of the circle at A to AB, which gives a new triangle ACD. The angle bisector of D will now divide AC in the ratio 1:2, such that AP = AC/3. Reduce the radius of the circle at A to AP and consider a new triangle ACD. The angles bisector will now divided AC in the ratio 1:3, and so on.

References

  1. N. Besteman and J. Ferdinands, Another Way to Divide a Line Segment into n Equal Parts, Mathematics Teacher, Vol. 98, No. 6 (Feb. 2005), pp. 428-433

Copyright © 1996-2008 Alexander Bogomolny

28773220Page copy protected against web site content infringement by Copyscape


Search:
Keywords:


Latest on CTK Exchange
Math
Posted by Laura
2 messages
06:56 AM, Apr-15-08

Divisibility rules - Jargon buste ...
Posted by Carolyn
2 messages
08:35 AM, Apr-04-08

drawing puzzle
Posted by martin gran
31 messages
06:53 PM, May-09-08

conway's game of life
Posted by frequency
0 messages
11:52 PM, May-12-08

Mistake on the page (an aside, Be ...
Posted by Max
4 messages
10:28 AM, Feb-28-08

Need details on a part of Proof o ...
Posted by Manuel S.
2 messages
05:24 PM, May-16-08

Josephus Flavius (correction)
Posted by David Turner
1 messages
09:42 AM, May-14-08