[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [obm-l] Congruencias
- To: obm-l@xxxxxxxxxxxxxx
- Subject: Re: [obm-l] Congruencias
- From: "saulo nilson" <saulo.nilson@xxxxxxxxx>
- Date: Fri, 15 Feb 2008 23:46:01 -0300
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:message-id:date:from:to:subject:in-reply-to:mime-version:content-type:references; bh=wFE4bAfFYTlUfa1whC+fFWEipuFQcBHn73R5DwQ4aaQ=; b=xULQ3GYv+gLiMY0QDti9E7ZUi9nDi3CMm2ydRbCGpSE2JcmX+9TM3Go+nfJjOObS+Ua8QESg1SD/RVUmEgxV90mpPZdSwUV1vfWAy4zdOtG1jSdEuzehTXxJ/EbpJIDDGVmSWAlYePaLxA5g0kmfQmsg7DQDeerm93+9fMbA6GA=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:in-reply-to:mime-version:content-type:references; b=ZXK3mRk1zwl3TZENhb9iF8YnBLmlGxGdIf3bzD/bXt9QHiXy8yEs3ghtSx485UD7lhu3GLoZiEna/563qA4NJOkNMrLDFpK1IUaJiy0JxboX9Yq4bi7rq+8RusvD1rmu6ew72ppXLuPUT8eOpX6eUvzmh//ZlT6J5RpIqr76T+M=
- In-reply-to: <cbbc13d00802100355pc133a10iea75a10dada8d355@xxxxxxxxxxxxxx>
- References: <cbbc13d00802100355pc133a10iea75a10dada8d355@xxxxxxxxxxxxxx>
- Reply-to: obm-l@xxxxxxxxxxxxxx
- Sender: owner-obm-l@xxxxxxxxxxxxxx
s= 1+soma(2 a n-1)mod(n-1)=
=1+(2+n-1)*(n-2)/2mod(n-1)=1+(n+1)(n-2)/2mod(n-1)=
= 1+(k+1)(2k-1)mod2k=
=q*2k+2k^2+k=k*(2q+2k+1)
On 2/10/08, Igor Battazza <battazza@xxxxxxxxx> wrote:
Bom dia!
Estava resolvendo uns problemihas de congruencia e enrosquei nesse aqui:
"Prove que n divide 1^n + 2^(n-1) + ... + (n-1)^(n-1) se n é ímpar."
Acho que não estou conseguindo compreender o enunciado (se isso ja n é proposital por quem o elaborou)
Qualquer ajudda é bem vinda!
Obrigado,
Igor F. Carboni Battazza.