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)

See The Solution Submitted by owl    
Rating: 4.3333 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Puzzle Answer Comment 4 of 4 |
The required product of the lengths of these line segments is N.

** I hope that I will be alle to posit an independent explanation of my own.

  Posted by K Sengupta on 2022-07-02 04:47:09
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