[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[obm-l] Função
- To: obm-l@xxxxxxxxxxxxxx
- Subject: [obm-l] Função
- From: Renan Kruchelski Machado <renankmachado@xxxxxxxxx>
- Date: Mon, 31 Oct 2005 13:13:05 -0200
- DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com; h=received:message-id:date:from:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition; b=KlZBD8aLGUD5X3ugEbuJmWi08dU7W3xlgn05D+6Gk5j/Brv+IrM7atg/WR5o5S/d+4sRAdcXKAA5R/nLI9aErQxUqgBzgKLP01sDuWTOyfq1UbakcMkuQmoFE6HPQNpekEvd9f4NMS3JiDyF9ZVQxreYlCF9I3G2xjdbMLzz+9c=
- Reply-To: obm-l@xxxxxxxxxxxxxx
- Sender: owner-obm-l@xxxxxxxxxxxxxx
Oi pessoal, gostaria de ajuda neste problema
Determine todas as funções estritamente crescentes f: N* --> N* tais que
f(n+f(n))=2f(n)
=========================================================================
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
=========================================================================