littlej
Members
Content count
86 
Joined

Last visited
Never
littlej's Activity

littlej added a post in a topic

littlej added a post in a topic
We should add a couple twists to this puzzle:
1) How many different unique solutions exist?
2) Can you determine a set of positive integer numbers that makes a unique solution? If not, what is the minimum sum required to form a unique solutions (i.e. all add to 50 instead of 25).

0


littlej added a post in a topic

littlej added a post in a topic

littlej added a post in a topic

littlej added a post in a topic

littlej added a post in a topic

littlej added a post in a topic
I should add that I do not know the answer to #4, thus the (Impossible?) tag.

0


littlej added a topic in New Logic/Math Puzzles

littlej added a post in a topic
Neat Thanks. Do you interpret the question differently?

0


littlej added a post in a topic
I'm not sure I understand what you are mean  the question is about circles, not hexagons. There is no possible way to fill up all white space. I believe there will be conditions where it is optimum not to put the circles into the recesses. You are limited to 1 circle every two recesses doing this  try it out. You will see the effect as the size of the smaller circles decrease.
A note about the 'least number of circles': I assumed that he just made a typo  it would be fairly obvious that 1 is the least number of circles as long as it is smaller.

0


littlej added a post in a topic
He is looking for a generalized solution.

0


littlej added a post in a topic
Wow, yes it does make sense. Thanks.

0


littlej added a post in a topic
How did you get to your answer?

0


littlej added a post in a topic
Wouldn't you need Math.pow(i,j) ^ Math.pow(i,j) (i.e. ^ instead of *)? the result is extremely large (a much large integer than I can handle in my programming language).
There has to be a different approach...

0
