Nrich recently updated their amazing website. I love exploring their backlog of puzzles and games — what a mother lode of resources for math club or a homeschool co-op class!
Like this post?
- Click to share on Facebook (Opens in new window) Facebook
- Click to share on X (Opens in new window) X
- Click to share on Pinterest (Opens in new window) Pinterest
- Click to share on Bluesky (Opens in new window) Bluesky
- Click to share on Mastodon (Opens in new window) Mastodon
- Click to share on Threads (Opens in new window) Threads
- More
- Click to email a link to a friend (Opens in new window) Email
- Click to share on Delicious (Opens in new window) Delicious
- Click to share on LinkedIn (Opens in new window) LinkedIn
- Click to share on X (Opens in new window) X
- Click to share on Pocket (Opens in new window) Pocket
- Click to share on Tumblr (Opens in new window) Tumblr
- Click to share on Telegram (Opens in new window) Telegram
- Click to share on Reddit (Opens in new window) Reddit
- Click to print (Opens in new window) Print
- Click to share on Nextdoor (Opens in new window) Nextdoor
- Click to share on WhatsApp (Opens in new window) WhatsApp
Denise Gaskins' Let's Play Math 
There are 55 connections, since there are curved connections too.
Only 46 connections. The outer circle is a single curved line, not 10 curved lines.
For a 100 pointed rose, 5050 connection including the curves.
Agree with jay 🙂 Btw, Cool riddle ! Riddles of that kind that i see here, you can find in Da Vinci Mystery game, very interesting riddles ! https://itunes.apple.com/us/app/davinci-mystery-pro/id555498867
So basically, you guys are saying that the answer is the sum of all integers between 1 and n, inclusive, where n = the number of points. Gauss gives us the equation cnt = (n*(n-1))/2 to determine the solution. It’s worth noting that you’d still have to subtract n from this value if the circle were a polygon.
Yes, Holosim, the answer is the sum of the first n whole numbers. If you look at the lines, you will see the outermost lines form an n-sided polygon. So if you posed the puzzle within the boundary of a polygon, those lines would already be covered, which explains why you would have to subtract n from the formula.