For integer 0 ≤ n ≤ 2 0 0 , find the sum of all n such that n ( n − 1 0 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.
Both of these methods are incorrect.
Method 2 is wrong. Do you see why? Hint: What assumption about the number of roots are you making?
Method 1 is slightly wrong. Do you see why?
Hint: Uniqueness of prime factorization only works if
1. All of the terms are primes
2. All of the terms are non-zero (or positive)
In your method 1, how do you prove that you can't possibly break n into other factors. You only included two cases, where the factors were 1 0 1 , n , but never accounted for the possibility that n could be broken apart.
Log in to reply
That is a correct criticism of method 1. Thanks for pointing it out!
Are you sure you want n to be a real number? If so, this problem is completely wrong.
Method 2 is wrong. Do you see why? Hint: What assumption are you making?
Method 1 is slightly wrong. Do you see why?
Hint: Uniqueness of prime factorization only works if
1. All of the terms are primes
2. All of the terms are non-zero (or positive)
Method 2 is incorrect. You cannot use Vieta's for a polynomial with 2 variables since m 2 is not a constant. (Correct me if I am wrong)
Log in to reply
You are somewhat incorrect. Vieta's formula would still hold, with the conclusion being that there would be a pair of roots which sum up to 101.
The issue is that we don't know how many pairs of roots there are. If there are 2 pairs (and assuming that all of these fall within the given range, which is not guaranteed), then the answer would have been 202. For example, in the previous version where real numbers were allowed, then number of the form 2 1 0 1 ± 1 0 2 0 5 would have been acceptable solutions.
Log in to reply
Yeah the answers would have been 202 because the possible values of n are 101,0,2601,-2500.
Then how about n = 2601? Doesn't it gives:
n ( n − 1 0 1 ) = 2 5 5 0 2
?
If we have the n without criteria do we assume n ∈ Z ? Or still use n ∈ R ?
Cheers! @Mehul Arora
Let n(n-101)=m^2, m being positive. Now simply apply quadratic formula for n, and discriminant would be 101^2+4m^2, which should be a perfect square say p^2, p being positive. So (p-2m)(p+2m)=101^2. As 101 is a prime number, so either p-2m=1 and p+2m=101^2 or both equal to 101. From here it is easy to see that n can only be 101 and zero in the range 0 to 200
Problem Loading...
Note Loading...
Set Loading...
METHOD 1
n ( n − 1 0 1 ) = m 2
n 2 − m 2 = 1 0 1 n
( n + m ) ( n − m ) = 1 0 1 n
∵ 1 0 1 is prime,
Case 1 : ( n + m ) = 1 0 1 ( n − m ) = n
If ( n − m ) = n , ∴ m = 0
Case 2 : ( n − m ) = 1 0 1 ( n + m ) = n
I f ( n + m ) = n , ∴ m = 0
Thus, we conclude that n ( n − 1 0 1 ) = 0
∴ n = 0 , 1 0 1
Adding both, we get 101.