This blog is hosted on WordPress.com. You can read their privacy notice here.
If you want to comment on a post, we ask for your name (you can use a pseudonym) and email address—your home website is optional, for those who want the link. This helps us detect and avoid spam comments.
If you subscribe to blog posts by email (the blue envelope icon in the social media links above), those come from Feedburner, which is a Google service. You can read Google’s privacy policy here.
If you ask to receive updates about our books, we use your email address only to send you the newsletter(s) you request. These updates will include promotional material such as notice of a book release, limited-time discount prices, or other news.
Our newsletters are powered by MailChimp. You can read their privacy policy here.
We will not contact you directly unless it’s necessary to reply to your comment or question. For instance, if you offered to host the Playful Math Education Blog Carnival, we’ll need to confirm your date and send you information. We LOVE carnival hosts!
We do not share your name or email, except where it’s necessary to provide the service (comment posting or newletter) you requested, or unless the law requires us to do so.
Want to help your kids learn math? Claim your free 24-page problem-solving booklet, and sign up to hear about new books, revisions, and sales or other promotions.
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.