Browse Groups

• Ok, here is another property: all the records for N
Message 1 of 5 , Jan 3, 2010
View Source
Ok, here is another property:

all the records for N<27 are multiple of 3.

Does that mean that the tops should alway be multiple of 3 ?

JC

[Non-text portions of this message have been removed]
• I don t think so, but I don t have a proof here. However, if you consider smaller values of C (the number of colors) the property you suggest breaks at some
Message 1 of 5 , Jan 3, 2010
View Source
I don't think so, but I don't have a proof here. However, if you consider
smaller values of C (the number of colors) the property you suggest breaks
at some point, for example for C = 3, you get 3,9,20... and for all C < 10
(as far as my solutions for smaller C are in fact optimal) there is a point
where it stops being divisible by 3 and it comes faster than for C=10, so it
is more reliable. I have some ideas on where this happens but that would be
a longish post and also probably inappropriate for an unfinished contest.

Marcin

On Mon, Jan 4, 2010 at 1:44 AM, Jean-Charles Meyrignac <
jcmeyrignac@...> wrote:

>
>
> Ok, here is another property:
>
> all the records for N<27 are multiple of 3.
>
> Does that mean that the tops should alway be multiple of 3 ?
>
> JC
>
>
> [Non-text portions of this message have been removed]
>
>
>

--
Dwell not on close decisions, and thus, when you play against dwellers, you
will make reciprocal gains in energy conservation and sanity preservation.

Tommy Angelo

[Non-text portions of this message have been removed]
Your message has been successfully submitted and would be delivered to recipients shortly.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.