Find all integers $n$, such that the following number is a perfect square \[N= n^4 + 6n^3 + 11n^2 +3n+31. \]
Problem
Source: CWMO 2004, problem 1
Tags: number theory proposed, number theory
23.10.2004 15:53
For n>10 (n <sup>2</sup>+3n+1) <sup>2</sup> >N >(n <sup>2</sup>+3n) <sup>2</sup> For -2>n (n <sup>2</sup> +3n+2) <sup>2</sup> >N>(n <sup>2</sup> +3n+1) <sup>2</sup> So for 10 >=n>=-2 the only variant is n=10
23.10.2004 19:02
This is quite an easy one for a chinese olimpiad, isn't it so?
06.08.2016 19:12
is there any simple solution please?
06.08.2016 22:52
need help please
06.08.2016 23:35
See there https://www.artofproblemsolving.com/community/c6h1285523
07.08.2016 00:03
I edited the problem to more complicated one
12.09.2016 01:24
$$n^4+6n^3+9n^2<N= n^4 + 6n^3 + 11n^2 +3n+31<n^4+6n^3+13n^2+12n+4$$$$\therefore (n^2+3n)^2<N<(n^2+3n+2)^2$$So $N$ must be equal to $(n^2+3n+1)^2$ $$\therefore N= n^4 + 6n^3 + 11n^2 +3n+31=n^4+6n^3+11n^2+6n+1$$$$\therefore 3n+31=6n+1$$$$\therefore n=\color{red}10$$ When $n=10$, $N=131^2$.
12.09.2016 01:48
Yes, bounding always does kill problems like this.