2

Define the function $g:\mathbb N \rightarrow \mathbb N$ with $g(d)= d^2 + d + 1$

I started out by assuming that if two arbitrary elements of $\mathbb N$, $x$ and $y$,where $x>y$ without loss of generality, then $g(x)=g(y)$. So \begin{align*}x^2 + x + 1 &= y^2 + y + 1\\ (x+1)(x-1)&=(y+1)(y-1)\\ x^2 + x &= y^2 + y.\end{align*}

I've tried rearranging the equation like this to try and find the contradiction. Am I on the right track? Any hints or advice would be appreciated.

2 Answers2

2

Use the fact that since $x>y$ and $x,y\in \mathbb N$, then $x^2 >y^2$, so $x^2+x>y^2+y$, in contradiction of your equality

Alan
  • 16,582
1

A simpler proof uses the fact that $g$ is monotone increasing, that is $g(d) < g(d+1)$. There are many ways of showing that: you can calculate $g(d+1) - g(d) = 2d+2 > 0$, or you can calculate $g'(d) = 2d+1 > 0$.

Yuval Filmus
  • 57,157
  • Or say it is the sum of functions known to be increasing. That's what is implicitly used in @Alan's proof. – Bernard Mar 27 '15 at 01:42