INTRODUCING 5 - days-a-week problem solving session for Math Olympiad and ISI Entrance. Learn More 

September 16, 2017

Checking injectivity | TIFR 2013 problem 36

Let's solve a problem based on checking injectivity from TIFR 2013 problem 36. Try it yourself first, then read the solution here.



The function \(f:\mathbb{Z} \to \mathbb{R} \) defined by \(f(n)=n^3-3n\) is injective.


Check for small values!


Surely, checking for small values will give you that f is not injective.

For example, let us look at \(f(0)=0\), \(f(1)=-2\), \(f(-1)=2\), \(f(2)=2\).

So \(f(-1) = f(2)\).

Therefore, \(f\) is not injective.

Some useful links:

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Cheenta. Passion for Mathematics

Advanced Mathematical Science. Taught by olympians, researchers and true masters of the subject.