Let n be a positive integer. The number of n 's for which n 4 + 2 n 3 + 2 n 2 + 2 n + 1 is a perfect square.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
n 4 + 2 n 2 + 1 + 2 n 3 + 2 n = ( n 2 + 1 ) 2 + 2 n ( n 2 + 1 ) = ( n 2 + 1 ) ( n 2 + 2 n + 1 ) = ( n 2 + 1 ) ( n + 1 ) 2 = k 2 , k ∈ Z + ,but this isn't possible as n 2 + 1 can never be a square.
Log in to reply
Exactly same solution.
@Adarsh Kumar Why did you post your solution as a reply?
Log in to reply
I did so because my dad thought that I couldn't solve this problem(he is very bad at NT,so he wasn't able to see how easy the problem was) and hence saw the solution.
Yeah, no pythagorean triplet contains 1 :)
how you factorised it can you please explain
The problem is equivalent to the following equation: n 4 + 2 n 3 + 2 n 2 + 2 n + 1 = a 2 ⇒ n 4 + 2 n 3 + n 2 + n 2 + 2 n + 1 = a 2 ⇒ n 2 ⋅ ( n 2 + 2 n + 1 ) + 1 ⋅ ( n 2 + 2 n + 1 ) = a 2 ⇒ ( n 2 + 2 n + 1 ) ⋅ ( n 2 + 1 ) = a 2 ⇒ ( n + 1 ) 2 ⋅ ( n 2 + 1 ) = a 2 ⇒ ( n 2 + 1 ) = ( n + 1 a ) 2 ∈ Z + ⇒ n + 1 a = k ∈ Z + n 2 + 1 2 = k 2 ↓ ( l ⋅ 2 p q ) 2 + ( l ⋅ ( p 2 − q 2 ) ) 2 = ( l ⋅ ( p 2 + q 2 ) ) 2 There isn’t any non-primary or primary pythagorean triplet constituted of 1 since: l ⋅ 2 p q = 1 and l ⋅ ( p 2 − q 2 ) = 1 for l, p, q integers.
Same. ( n 2 + 1 ) can be a perfect square if n=0. But 0 is not a natural number.
Yeah i did same
Well divide the equation by n^2 and substitute n+1/n as y. the equation reduces to y^2+2y-1=k^2 can be written as( y+1)^2-2=k^2 as no perfect squares differ in the interval of 2 we say that no required y and hence no n!!!!!
Multiply and divide the whole expression by n^2 and make a quadratic in n+(1/n). Rest you can do yourself. :-)
Given in rajeev manocha !!this is a cool techniques but not as easy as you said!
Problem Loading...
Note Loading...
Set Loading...
n 4 + 2 n 3 + 2 n 2 + 2 n + 1 = ( n + 1 ) 2 ( n 2 + 1 )
now we can make following cases :
n 2 + 1 = 1
n = 0
and
( n + 1 ) 2 = 0
n = − 1
so no such required n