[obm-l] teoria numeros

To: obm-l@xxxxxxxxxxxxxx
Subject: [obm-l] teoria numeros
From: Klaus Ferraz <klausferraz@xxxxxxxxxxxx>
Date: Sun, 26 Mar 2006 22:43:46 +0000 (GMT)
DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com.br; h=Message-ID:Received:Date:From:Subject:To:MIME-Version:Content-Type:Content-Transfer-Encoding; b=zH8ZNAle8F1qmW8UqqxjiAjS0K0IKzwL52GiS5sZ16WCQnoV8LKUQ1lvY0iznCt83UmuWNDMvJhR3rfvHQiOumuytGsgLBeSO4e9VYzkbRGs1oYv4ka/9+xOTQEDNACJ71MpGjv/mj3HFX7OUKonSQaPmNJYriUyM9FBen9Zljg= ;
Reply-To: obm-l@xxxxxxxxxxxxxx
Sender: owner-obm-l@xxxxxxxxxxxxxx

Prove que ' 2^n '+' 5^n ' sempre tem n+1 digitos. Por exemplo '2^1' + '5^1' = 25

' 2^2 ' +' 5^2 ' = 425.

Yahoo! Messenger com voz - Instale agora e faça ligações de graça.