A fraction, expressed in its lowest terms b a , can also be written as n 2 + n 2 1 , where n is a positive integer.
If a + b = 1 0 2 4 , what is the value of a ?
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.
b a = n 2 + n 2 1 = n 2 2 n + 1
Now we can see that a and b are in the form of 2 n + 1 and n 2 respectively.
a + b n 2 + 2 n + 1 n 2 + 2 n − 1 0 2 3 = 1 0 2 4 = 1 0 2 4 = 0
Now we can solve the above quadratic equation and we'll get n = − 3 3 , 3 1 . But − 3 3 will be rejected as n is a positive integer, so, n = 3 1 .
Placing n = 3 1 in n 2 2 n + 1 will give us the value of a as 2 n + 1 = 6 3 .
There is a slight leap in going from b a = n 2 2 n + 1 and claiming that a = 2 n + 1 and b = n 2 .
For example, since we have 4 3 = 8 6 , can we conclude that 3 = 4 and 6 = 8 ? If not, what is so special about this scenario?
There is a slight leap in going from b a = n 2 2 n + 1 and claiming that a = 2 n + 1 and b = n 2 .
For example, since we have 4 3 = 8 6 , can we conclude that 3 = 4 and 6 = 8 ? If not, what is so special about this scenario?
Log in to reply
The reason is that n^2&2n+1 are coprime
Log in to reply
Indeed! And of course, we should show why:
( \gcd(2n+1, n^2 ) \leq \gcd( 2n+1, 4n^2) \leq \gcd ( (2n+1)(2n-1) , 4n^2) = \gcd (4n^2 -1 , 4n^2) = \gcd(1, 4n^2) ]
Rewrite the n terms into one fraction; b a = n 2 2 n + 1 So we know that a is always odd, so for a + b = 1 0 2 4 = 2 1 0 to hold true, b is odd. Thus in our case,
n = 2 k + 1 : k ∈ N 0
So we have
a = 4 k + 3 b = 4 k 2 + 4 k + 1
Thus,
a + b = 4 k + 3 + 4 k 2 + 4 k + 1 = 2 1 0 k 2 + 2 k + 1 = 2 8 ( k + 1 ) 2 = 2 8 So k = 1 5 n = 3 1 a = 6 3
It is given that:
n 2 + n 2 1 n 2 2 n + 1 n 2 2 n + 1 n 2 2 n + 1 + 1 n 2 2 n + 1 + n 2 ( n n + 1 ) 2 = b a and that a + b = 1 0 2 4 = b 1 0 2 4 − b = b 1 0 2 4 − 1 = b 1 0 2 4 = b 1 0 2 4 = ( b 3 2 ) 2
⇒ n = 3 1 and b = 3 1 2 = 9 6 1 ⇒ a = 1 0 2 4 − 9 6 1 = 6 3
There is a huge leap in going from ( n n + 1 ) 2 = ( b 3 2 ) 2 to n = 3 1 , b = 3 1 2 . In particular, that is not the only solution. We could have b = 1 6 2 , n = 1 .
First, add together n 2 and n 2 1 to get a single fraction. Given that b a is the reduced form of n 2 + n 2 1 , n 2 + n 2 1 = b a .
n 2 + n 2 1 = b a
n 2 2 n + 1 = b a
Substituting the numerators and denominators into a and b in a + b = 1 0 2 4 , we get n 2 + 2 n + 1 = 1 0 2 4 . This is a quadratic that we can solve, and factoring this equation, we now have ( n − 3 1 ) ( n + 3 3 ) = 1 0 2 4 .
Finally, we solve for the n values, and we get n = 3 1 and n = − 3 3 . But which n value is the one we want? Well, if we plug the two values into n 2 2 n + 1 = b a , only n = 3 1 will yield a positive a. value (stated in the problem). Thus, a = 2 ( 3 1 ) + 1 = 6 3 .
There is a slight leap in going from b a = n 2 2 n + 1 and claiming that a = 2 n + 1 and b = n 2 .
For example, since we have 4 3 = 8 6 , can we conclude that 3 = 4 and 6 = 8 ? If not, what is so special about this scenario?
There is a slight leap in going from b a = n 2 2 n + 1 and claiming that a = 2 n + 1 and b = n 2 .
For example, since we have 4 3 = 8 6 , can we conclude that 3 = 4 and 6 = 8 ? If not, what is so special about this scenario?
Log in to reply
Is this valid?
Because "a" is the reduced form of 2 n + 1 and "b" is the reduced form of n 2 , it can be assumed that a = 2 n + 1 and b = n 2 .
Log in to reply
Not quite. You are not at the heart of the matter as yet.
The key is to explain that n 2 2 n + 1 is in reduced form (and both are positive). That is the implicit assumption (IE What is so special about this scenario?) in order for us to conclude that the numerators and denominators are identical.
Sir, we have g c d ( 2 n + 1 , n 2 ) = 1 . So, we can assume that a = 2 n + 1 , b = n 2
Thank you sir
Problem Loading...
Note Loading...
Set Loading...
Since a + b = 1 0 2 4 we can say that b a = 1 0 2 4 − a a leading to 1 0 2 4 − a a = n 2 2 n + 1 .
Cross multiplying gives us a n 2 = 2 0 4 8 n − 2 a n + 1 0 2 4 − a .
Bringing all the terms with a to one side and factoring we get a ( n 2 + 2 n + 1 ) = 1 0 2 4 ( 2 n + 1 ) .
Dividing through we get a = ( n + 1 ) 2 1 0 2 4 ( 2 n + 1 ) .
Because b a is in lowest terms both a and b cannot be even. With the sum a + b = 1 0 2 4 we can see that both must be odd.
Because a must be odd 1 0 2 4 must be completely divided by ( n + 1 ) 2 . Thus 3 2 ∣ n + 1 .
Let k be the value such that 3 2 k = n + 1 , thus n = 3 2 k − 1 .
Substituting we get a = 1 0 2 4 k 2 1 0 2 4 ( 6 4 k − 1 ) = k 2 ( 6 4 k − 1 ) .
The only value for which this is an integer is k = 1 .
Thus n = 3 1 and a = 6 3 .