Open Side Menu Go to the Top
Register
Puzzles ITT Puzzles ITT

12-08-2016 , 11:20 PM
269+18=287=7*41
Puzzles ITT Quote
12-08-2016 , 11:38 PM
damnit i was more tired than I thought
Puzzles ITT Quote
12-08-2016 , 11:44 PM
641 works if I had 6 instead of 8. In looking through the numbers I did see several that fit with all of them except 8, but did with 6. Maybe 6 would work better, if someone can look through them.
Puzzles ITT Quote
12-08-2016 , 11:44 PM
Interested to learn the process to solve this rather than simply trial and error
Puzzles ITT Quote
12-09-2016 , 12:51 AM
My 12 year old daughter and I programmed a solution for puzzle #18 tonight, but I am not sure that using computers is allowed here. We found one solution if having 0 on a face is allowed and another solution if all faces have to be positive. I won't post anything to be on the safe side viz a viz the thread rules.
Puzzles ITT Quote
12-09-2016 , 12:56 AM
Interested to see this program...
Puzzles ITT Quote
12-09-2016 , 01:06 AM
Generating a list of prime numbers is easy. We pass the list of primes to our program.

Our program takes the difference between each pair of prime numbers and puts these differences into an NxN matrix where N is the number of prime numbers in the list we passed.

We then loop over combinations of 6 distinct even numbers (including or excluding 0 as desired) and tally how many of these numbers are contained in each row of the matrix.

The program stops when it finds 6 rows containing the 6 differences.
Puzzles ITT Quote
12-09-2016 , 07:51 AM
That just gave me an idea - the die faces can be negative as well, there's no restriction against it.
Puzzles ITT Quote
12-09-2016 , 08:33 AM
Anyone who wants a hint to get an answer without having to just wildly guess:

Puzzles ITT Quote
12-09-2016 , 09:02 AM
Spoiler:
So we have to look for prime sextuplets of the same pattern. And that page only lists 5 of them (we need 6) and they're into 5 digit numbers. Yeah there's no way we were getting this without some serious help from internet or computer program.
Puzzles ITT Quote
12-09-2016 , 09:13 AM
Quote:
Originally Posted by Lattimer
Spoiler:
So we have to look for prime sextuplets of the same pattern. And that page only lists 5 of them (we need 6) and they're into 5 digit numbers. Yeah there's no way we were getting this without some serious help from internet or computer program.
This is why I said that research was allowed
Puzzles ITT Quote
12-09-2016 , 09:21 AM
Here is an answer:

Spoiler:
This page did the work for us: https://oeis.org/A022008
Spoiler:
7, 97, 16057, 19417, 43777, 1091257
0, 4, 6, 10, 12, 16
Puzzles ITT Quote
12-09-2016 , 01:04 PM
Spoiler:
FWIW all of the answers we came up with last night via computer program were less than 1,000.
Puzzles ITT Quote
12-09-2016 , 01:10 PM
Quote:
Originally Posted by whosnext
Spoiler:
FWIW all of the answers we came up with last night via computer program were less than 1,000.
well post it
Puzzles ITT Quote
12-09-2016 , 01:12 PM
yeah post your computer program's solution please
Puzzles ITT Quote
12-09-2016 , 01:25 PM
Oh, I didn't know if computers were allowed....

Spoiler:
If zero is allowed:
0, 2, 8, 18, 30, 32
11, 29, 71, 149, 431, 569

If positives are required:
4, 6, 16, 30, 34, 40
7, 13, 67, 97, 277, 823

Puzzles ITT Quote
12-09-2016 , 02:04 PM
Quote:
Originally Posted by e_holle
#13 Showing my work.

Spoiler:
There are three groups of four prisoners. The rearmost prisoner looks at the three in front of him. If the two immediately in front of him have the same colour hat, he calls out the colour of the hat of the third (frontmost) prisoner. Otherwise, he calls out the opposite colour of the third prisoner.

Call the prisoners ABCD. B knows if A called out D's colour correctly. If It is correct, then B knows he has the same colour as C. If not, he knows he has the opposite colour to C.

C also knows if A called out D's colour correctly, so he knows if the colour called out by B matches his own or is the other colour.

D knows that if B and C call out the same colour, then his hat must be the colour called out by A. If they call different colours, then D has the opposite colour to the one called by A.

So BCD know their colours and will be freed. A has a 50% chance (I assume) of being right about his own hat.

The three groups of four prisoners will each have three freed and one with a 50% chance.
Can't you guarantee 11 and a 50/50 chance for the last guy?

Spoiler:
Last guy sees 11 hats, so one color will have an odd number and one will have an even number. He calls out the odd number as his guess for his color hat (the "chosen" color). He has 50/50 chance at being right.

11th guy knows this color should have an odd number of hats - if he sees an odd number in front of him he knows he has the other color. If he sees an even number he knows he has the chosen color.

Each time someone names the chosen color as their hat, the rest of the guys know that the count has changed, from odd to even or from even to odd. If their count matches then they have the other color hat. If their count is different then they have the chosen color.
Puzzles ITT Quote
12-09-2016 , 02:35 PM
Quote:
Originally Posted by whosnext
Oh, I didn't know if computers were allowed....

Spoiler:
If zero is allowed:
0, 2, 8, 18, 30, 32
11, 29, 71, 149, 431, 569

If positives are required:
4, 6, 16, 30, 34, 40
7, 13, 67, 97, 277, 823

I think they're fine for problems like these where it's virtually impossible to solve without some help (be it internet or computer program or whatever). That also looks right to me, well done.
Puzzles ITT Quote
12-09-2016 , 02:56 PM
Quote:
Originally Posted by pudley4
Can't you guarantee 11 and a 50/50 chance for the last guy?

Spoiler:
Last guy sees 11 hats, so one color will have an odd number and one will have an even number. He calls out the odd number as his guess for his color hat (the "chosen" color). He has 50/50 chance at being right.

11th guy knows this color should have an odd number of hats - if he sees an odd number in front of him he knows he has the other color. If he sees an even number he knows he has the chosen color.

Each time someone names the chosen color as their hat, the rest of the guys know that the count has changed, from odd to even or from even to odd. If their count matches then they have the other color hat. If their count is different then they have the chosen color.
I think this is correct. I tried it on a few sample configurations and it's worked every time.
Puzzles ITT Quote
12-09-2016 , 03:07 PM
That puzzle caught my eye since my daughter has recently learned about prime numbers and is beginning to learn about computer programming. So solving the puzzle via a simple computer program seemed to be a confluence of learning opportunities.
Puzzles ITT Quote
12-09-2016 , 05:43 PM
For the prime puzzle I think this might be the smallest solution:

Spoiler:
0, 6, 12, 36, 42, 96 and 5, 17, 31, 47, 61, 71
Puzzles ITT Quote
12-09-2016 , 06:29 PM
Quote:
Originally Posted by xander biscuits
For the prime puzzle I think this might be the smallest solution:

Spoiler:
0, 6, 12, 36, 42, 96 and 5, 17, 31, 47, 61, 71
There are lots of non primes there
Puzzles ITT Quote
12-09-2016 , 06:44 PM
yeah there are

that's what I get for copying that answer from a forum and not fully checking it
Puzzles ITT Quote
12-09-2016 , 08:41 PM
I kicked off my computer program on the primes and ...

Spoiler:
The smallest number of pips I get is:
0, 6, 12, 36, 42, 96
5, 11, 17, 31, 61, 67
which is a total of 384
Puzzles ITT Quote
12-09-2016 , 11:07 PM
Nice job, pudley4!
Puzzles ITT Quote

      
m