Re: BrainBashers: July 2007 Common Answers Results

Richard Heathfield <rjh@xxxxxxxxxxxxxxx> writes:
Simon Tatham said:

Richard Heathfield <rjh@xxxxxxxxxxxxxxx> wrote:
I'm pretty sure N=6 is a no-no, too, although I haven't proved it.

I think I can prove N>6. Also I can prove N<=7, solving the problem.

*Applause*

Seconded. Bravo.

I notice that the scheme works exactly the same with 9 questions
rather than 10, by dropping Simon's Q1.

2 2 2 2 2 2 2 2 2 = 512
1 1 2 3 3 3 3 1 2 = 324
3 1 1 2 3 3 3 2 1 = 324
3 3 1 1 2 1 2 3 3 = 324
3 3 3 1 1 2 1 3 3 = 486
2 3 3 3 1 3 3 1 1 = 486
1 2 3 3 3 1 1 3 3 = 486

I don't see how that could be shrunk to 8 questions and still
preserve the desired property.

ObFollowup:
How many entrants are required in order to make 8 questions have
a fitting solution? 7, fewer...

Phil
--
Dear aunt, let's set so double the killer delete select all.
-- Microsoft voice recognition live demonstration
.

Relevant Pages