[seqfan] Re: Counting problem

David Wilson dwilson at gambitcomm.com
Wed Jun 17 21:32:49 CEST 2009


At least it's not USAMO 1893...

Tanya Khovanova wrote:
> USAMO 2003 problem: 
> prove that for every positive integer n there exists an n-digit number divisible by 5n all of whose digits are odd. 
> 
> You can prove by induction that there is exactly one (as in Max's email)




More information about the SeqFan mailing list