[obm-l] Encontre o numero de 10 digitos

["Ricardo" <ricardo_paixao_santos@xxxxxxxxxxxx>]

 find a ten digit no?
tell me a ten digit no having all digits 0-9 only once... such that its
first digit is divisible by 1... first 2 digits should be divisible by 2 ...
first 3 digits should be divisible by 3 and so on the ten digit no should be
divisible by 10....
for ex if the no is 1234567890 then 12 should be divisible by 2 and 123
should be divisible by 3 and so on ....
lets see who gets it first??

obs: Eh possivel usar o teorema chines do resto?


		
_______________________________________________________
Yahoo! Acesso Grátis - Internet rápida e grátis. Instale o discador agora!
http://br.acesso.yahoo.com

=========================================================================
Instruções para entrar na lista, sair da lista e usar a lista em
http://www.mat.puc-rio.br/~nicolau/olimp/obm-l.html
=========================================================================