[seqfan] Re: A092236 Maths Olympiad problem
Tw Mike
mt.kongtong at gmail.com
Tue Jul 29 17:20:13 CEST 2014
You could download the book online. The book say this problem proposed for
1992 IMO. It seems IMO doesnt take this.
Yours mike,
2014-07-29 15:46 GMT+08:00 Kevin Ryde <user42_kevin at yahoo.com.au>:
> A092236 says it's from an International Mathematical Olympiad problem.
> Do we know which year?
>
> Various of those IMO problems and solutions are online and it could be
> nice to have a link. I don't think I have the Lozansky and Rousseau
> book referred to.
>
> (I struck this on a terdragon segment count, if I haven't made some
> horrible mistake, as recurrence and also sum
> (2^n)*binomial(n,0) + (2^(n-3))*binomial(n,3) + (2^(n-6))*binomial(n,6) +
> ...
> and wondered if that was the original problem, or just happened to be
> the same recurrence ... or both!)
>
>
>
> --
> The electronic delivery strategy makes it possible to deliver things
> electronically.
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
More information about the SeqFan
mailing list