Interested in advertising on Derpibooru? Click here for information!
Sky Railroad Merch Shop!

Help fund the $15 daily operational cost of Derpibooru - support us financially!

Description

No description provided.

suggestive195715 artist:catfood-mcfly687 cheerilee11464 rainbow dash287805 equestria girls264923 g42103163 breasts408853 clothes665164 dat ass531 dreamworks face1496 female1879784 incestria girls172 lesbian121753 math998 math in the comments11 meme96037 miniskirt7143 panties66269 pun9098 skirt58898 smugdash902 tumblr36610 underwear82042 upskirt7651 white underwear4151

Comments

Syntax quick reference: **bold** *italic* ||hide text|| `code` __underline__ ~~strike~~ ^sup^ %sub%

Detailed syntax guide

Background Pony #5F33
@Lopsy  
We have
f(n) = \sum_{k=0}^N m_k n^k.
Therefore
f(f(n)+1)/f(n) = 1/f(n) * \sum_{k=0}^N m_k (f(n)+1)^k = \sum_{k=0}^N \sum_{l=0}^k (k choose l) m_k f(n)^{l-1},
by Newton’s formula.
Change the order of summation to get
f(f(n)+1)/f(n) = \sum_{l=0}^N \sum_{k=l}^N (…)
and then split the sum over l into the l=0 term and the l>0 terms. The latter sum to an integer as each term is individually an integer, so we only need to check the l=0 term.
This is just
\sum_{k=0}^N m_k/f(n) = f(1)/f(n).
By hypothesis, f(n) is strictly larger than f(1) (in which case f(1)/f(n) is not an integer and f(n) does not divide f(f(n)+1)) unless n = 1 or f is a zero-degree polynomial (a constant).
Lopsy

This is problem B1 from the 2007 Putnam competition. “Let f be a polynomial with positive integer coefficients. Prove that if n is a positive integer, then f(n) divides f(f(n)+1) if and only if n=1.”
 
Any takers?