[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[SPAM] [obm-l] demonstração: pequeno teorema de FERMAT
- To: obm-l@xxxxxxxxxxxxxx
- Subject: [SPAM] [obm-l] demonstração: pequeno teorema de FERMAT
- From: Rodrigo Cientista <rodrigocientista@xxxxxxxxxxxx>
- Date: Sat, 24 Nov 2007 12:01:11 -0800 (PST)
- Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com.br; h=X-YMail-OSG:Received:X-Mailer:Date:From:Subject:To:MIME-Version:Content-Type:Content-Transfer-Encoding:Message-ID; b=BgXM2AaP7gX20kliVDid7gWvr43gujIjWnjOTX+nGy+YioKfmz0YXIzQqdWaX72HuhZRjA9FKQ/2sRsqEXdCylpOsU/ZqUV7wII7YbWSp54v/ZmZEaEhLYnPLgVu+A9ab1FyiCpa6JB9co0k6GETn+CuxNhlAnZsFDndRXs5suU=;
- Reply-to: obm-l@xxxxxxxxxxxxxx
- Sender: owner-obm-l@xxxxxxxxxxxxxx
SPAM: -------------------- Start SpamAssassin results ----------------------
SPAM: This mail is probably spam. The original message has been altered
SPAM: so you can recognise or block similar unwanted mail in future.
SPAM: See http://spamassassin.org/tag/ for more details.
SPAM:
SPAM: Content analysis details: (7.20 hits, 5 required)
SPAM: X_MAILING_LIST (-0.3 points) Found a X-Mailing-List header
SPAM: SPAM_PHRASE_00_01 (0.8 points) BODY: Spam phrases score is 00 to 01 (low)
SPAM: [score: 0]
SPAM: FORGED_YAHOO_RCVD (1.4 points) 'From' yahoo.com does not match 'Received' headers
SPAM: RCVD_IN_ORBS (2.2 points) RBL: Received via a relay in orbs.dorkslayers.com
SPAM: [RBL check: found 88.38.190.206.orbs.dorkslayers.com., type: 68.178.232.99]
SPAM: RCVD_IN_OSIRUSOFT_COM (0.4 points) RBL: Received via a relay in relays.osirusoft.com
SPAM: [RBL check: found 88.38.190.206.relays.osirusoft.com.]
SPAM: X_OSIRU_OPEN_RELAY (2.7 points) RBL: DNSBL: sender is Confirmed Open Relay
SPAM:
SPAM: -------------------- End of SpamAssassin results ---------------------
Em primeiro lugar olá a todos, sou novo na lista, e gostaria de saber se uma demonstração que dei para o pequeno teorema de fermat está equivocada ou não, conforme segue:
o teorema diz que n^p ==n mod p, o que não sabemos...
escreverei n == x mod p, assim n == x mod p implica n^p == x^p mod p (das propriedades de congruência)
n^p == x^p mod p equivale a x^p == n^p mod p (das propriedades de congruência)
se n == x mod p e x^p == n^p mod p então n + x^p == x+ n^p mod p (das propriedades de congruência)
assim x^p - x == n^p - n == 0 mod p implica n^p == n mod p como queríamos demonstrar
Abra sua conta no Yahoo! Mail, o único sem limite de espaço para armazenamento!
http://br.mail.yahoo.com/
=========================================================================
Instruções para entrar na lista, sair da lista e usar a lista em
http://www.mat.puc-rio.br/~obmlistas/obm-l.html
=========================================================================