All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Diagonal Product (Posted on 2005-10-20) Difficulty: 4 of 5
Suppose we have the N vertices of a regular N-gon inscribed in a circle of radius 1. Select one vertex W and draw line segments from W to each of the other N-1 vertices. What is the total product of the lengths of these line segments? (old problem - original author unknown)

  Submitted by owl    
Rating: 4.3333 (3 votes)
Solution: (Hide)
Arrange these points on the complex unit circle centered at 0 with W = W_0 = 1. The resulting complex values {W_i} of the N points are known as the Nth roots of unity, as for each i=0,1,...,N-1, we have (W_i)^N = 1. In other words, these are the N roots of the polynomial z^N-1.

Given the roots (and multiplicities) for a polynomial, we can factor it. In this case,
z^N-1=(z-1)(z-W_1)(Z-W_2)...(z-W_(N-1)).
We also remember the following identity from algebra:
(z^N-1)/(z-1)=z^(N-1)+z^(N-2)+...+z^2+z+1.
Putting these together gives
(z-W_1)(z-W_2)...(z-W_(N-1))=z^(N-1)+z^(N-2)+...+z^2+z+1.
If we let z=1, the left side of this identity becomes precisely the product of the diagonals, while the right side becomes the sum of N 1's. Thus, our answer is N.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Puzzle AnswerK Sengupta2022-07-02 04:47:09
SolutionSolutionBractals2005-10-20 17:35:27
Some ThoughtsThoughts toward a proofCharlie2005-10-20 14:21:02
Hints/TipsNo proof, but ... (spoiler)Charlie2005-10-20 13:54:01
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information