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

Home > Numbers
Dartboard (Posted on 2024-02-10) Difficulty: 3 of 5
I decided I wanted one of those dartboard puzzles for this website, the kind where you are given the scores for each ring of the dartboard, and you have to determine how many darts fell in each ring to get a given total.

I chose 4 different scores for the 4 rings, then I picked a total N that could only be reached one way. It required 10 darts. I noticed that each of the totals N+1, N+2, N+3, ..., N+10 also could be reached only one way, and in each case fewer than 10 darts were needed.

What is the smallest value of N for which this is possible?

No Solution Yet Submitted by K Sengupta    
Rating: 5.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsA value of NJer2024-02-12 15:19:02
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