For what positive integer value N < 1 0 0 0 is 5 N + 5 6 N 2 − 7 5 also an integer?
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.
This is the best way to solve this problem, several people used some variation of it. Other solutions exist as well, but they are more complicated.
This is really neat! I like it
I just bought some popcorn while reading the solutions. So far, your solution is the best. :)
Note that 5 N + 5 6 N 2 − 7 5 = 2 5 1 ⋅ 5 N + 5 6 2 5 N 2 − 1 8 7 5 = 2 5 1 [ 5 N − 5 6 + 5 N + 5 6 1 2 6 1 ] . It follows that 5 N + 5 6 1 2 6 1 is an integer, so 5 N + 5 6 is a factor of 1 2 6 1 . Since the positive factors of 1 2 6 1 = 1 3 ⋅ 9 7 are 1 , 1 3 , 9 7 , 1 2 6 1 , N > 0 and 5 N + 5 6 ≡ 1 ( m o d 5 ) , we get that 5 N + 5 6 = 1 2 6 1 or N = 2 4 1 .
This problem had a lot of wrong solutions submitted, where students made numerous unsubstantiated assumptions. For example, 1 solution stated that 1261 was prime, while another stated that the value of 5 N + 5 6 N 2 − 7 5 must be even.
Log in to reply
The statement that 5 N + 5 6 N 2 − 7 5 is not difficult to substantiate. (I am not sure how it helps, though.)
If N is even, the numerator N 2 − 7 5 is odd but the denominator 5 N + 5 6 is even. This will not result in an integer quotient. Therefore N is odd.
Writing N = 2 n + 1 , the fraction becomes 1 0 n + 6 1 4 n 2 + 4 n − 7 4 ; since the numerator is even and the denominator is odd, the quotient must be even, QED.
we assume the expression to be k , then we have N = 2 5 k ± 3 0 0 + 2 2 4 k + 2 5 k 2
since N must integer so 3 0 0 + 2 2 4 k + 2 5 k 2 must be perfect square. so 3 0 0 + 2 2 4 k + 2 5 k 2 = L 2 ⇒ ( 2 5 k + 1 1 2 ) 2 − ( 5 L ) 2 = 5 0 4 4
note that when N ≤ 8 there is no such N is suitable . so k must be > 0 .
now we divide the 5 0 4 4 = a × b and assume a > b ,then we have a + b = 2 ∗ ( 2 5 k + 1 1 2 ) > 0 , a − b = 2 ∗ ( 5 L ) > 0 . a − b must be multiple of 1 0 . so a = 2 × 1 3 × 9 7 , b = 2 , k = 4 6 , L = 2 5 2 .
finally, N = 2 5 k ± L = 2 4 1 , o r , − 1 1 and the answer is 2 4 1
given (5N+56)|(N^2-75) , then (5N+56)| (N(5N+56)-5(N^2-75)). this gives that (5N+56)| (56N+375) then 5N+56| (56(5N+56)-5(56N+375)) this gives that 5N+56|1261. but 1261=13*97. integer value of N is possible only if 5N+56=1261 this gives us n=241
The N satisfies N 2 ≡ 7 5 ( m o d 5 N + 5 6 ) Multiplying by 5 2 yields ( 5 N ) 2 ≡ 2 5 ⋅ 7 5 ( m o d 5 N + 5 6 ) which is the same as ( − 5 6 ) 2 ≡ 2 5 ⋅ 7 5 ( m o d 5 N + 5 6 ) Hence, 5 N + 5 6 ∣ ( − 5 6 ) 2 − 2 5 ⋅ 7 5 = 1 2 6 1 The divisors of 1 2 6 1 are { 1 , 1 3 , 9 7 , 1 2 6 1 } and only 1 2 6 1 is of the form 5 N + 5 6 for some positive integer N , namely 2 4 1 .
I really like this solution. It effectively bypasses the long division method which is a little too involved.
by long division, 5 N + 7 6 N 2 − 7 5 = 2 5 1 ( 5 N − 5 6 + 5 N + 5 6 1 2 6 1 ) . Note that 1 2 6 1 = 1 3 ⋅ 9 7 .Then the only factor in the form of 5 N + 5 6 is 1 2 6 1 , so N = 2 4 1 .Indeed, as it gives 5 N + 7 6 N 2 − 7 5 = 4 6 .So the only answer is 2 4 1 .
5 N + 5 6 N 2 − 7 5 is an integer if and only if 5 N + 5 6 ∣ N 2 − 7 5 . This is equivalent to 5 N + 5 6 ∣ 5 N 2 − 3 7 5 . Combined with the fact that 5 N + 5 6 ∣ 5 N 2 + 5 6 N , we have 5 N + 5 6 ∣ 5 6 N + 3 7 5 ⇒ 5 N + 4 5 ∣ 2 8 0 N + 1 8 7 5 . Also 5 N + 5 6 ∣ 2 8 0 N + 3 1 3 6 , so 5 N + 5 6 ∣ 1 2 6 1 . Since 1261 is prime, N = 5 1 2 6 1 − 5 6 = 2 4 1 .
If the given fraction were to be an integer, so is any of its integral multiples. In particular if N^2 – 75 is multiplied by 25, it facilitates division by 5N + 56 as follows: First observe that (5N + 56) (5N – 56) = 25N^2 – 3136. So we write 25(N^2 – 75) = 25N^2 – 1875 = (25N^2 – 3136) + 1261. 25(N^2 – 75) / (5N + 56) = (5N – 56) + [1261 / (5N + 56)]. So it suffices to find N such that 1261 / (5N + 56) = 1. It is easy to see that N = 241 serves the purpose. By actual verification, with N = 241, we find the value of the given fraction = 58006/1261 = 46.
By long division, N^2 -75 = (5N+ 56)(N/5 - 56/25) + 1261/25. Multiplying throughout gives us 25(N^2 -75) = (5N+ 56)(5N-56) + 1261.
Either (5N +56) or (5N-56) is a factor of 1261. For N to be a positive integer < 1000, the only possibility is 5N + 56 = 1261 which gives us 5N = 1205 and hence N = 241. This yields (241^2-75) / (5 x 241+ 56) = 46.
Since 2 5 ( N 2 − 7 5 ) = ( 5 N − 5 6 ) ( 5 N + 5 6 ) + 1 2 6 1 , it follows that 5 N + 5 6 divides N 2 − 7 5 if and only if 5 N + 5 6 divides 1 2 6 1 . Since 1 2 6 1 = 1 3 ⋅ 9 7 , the only possibilities are 5 N + 5 6 is 1 , 1 3 , 9 7 , or 1 2 6 1 . Since N is required to be a positive integer no greater than 1 0 0 0 it follows that 5 N + 5 6 = 1 2 6 1 ⟹ N = 2 4 1 .
We have to find an N ∈ N < 1 0 0 0 such that 5 N + 5 6 N 2 − 7 5 ∈ Z . So, 5 N + 5 6 ∣ N 2 − 7 5 . It follows that 5 N + 5 6 ∣ N ⋅ ( 5 N + 5 6 ) − 5 ⋅ ( N 2 − 7 5 ) = 5 6 N + 3 7 5 . Similarly, 5 N + 5 6 ∣ ( 5 6 N + 3 7 5 ) − 1 1 ⋅ ( 5 N + 5 6 ) = N − 2 4 1 . But we know that for all a ∈ Z , a ∣ 0 , so we just let N − 2 4 1 = 0 ⟹ N = 2 4 1 . Let's try it out:
5 N + 5 6 N 2 − 7 5 = 5 ⋅ 2 4 1 + 5 6 2 4 1 2 − 7 5 = 1 2 6 1 5 8 0 0 6 = 4 6 ∈ Z . Hence, N = 2 4 1 .
5 N + 5 6 N 2 − 7 5 = 2 5 1 ( 5 N − 5 6 + 5 N + 5 6 1 2 6 1 ) . In order for the fraction to be an integer, ( 5 N + 5 6 ) ∣ 1 2 6 1 . Since 1 2 6 1 = 1 3 × 9 7 , and N is a positive integer, the only possible value for N is 2 4 1 . It turns out that N = 2 4 1 is indeed a solution. So, N = 2 4 1 .
( 5 N + 5 6 ) ( 5 N − 5 6 ) = 2 5 N 2 − 3 1 3 6 .
If 5 N + 5 6 N 2 − 7 5 is an integer, then so is 5 N + 5 6 2 5 ( N 2 − 7 5 ) = 5 N + 5 6 2 5 N 2 − 1 8 7 5 = 5 N + 5 6 2 5 N 2 − 3 1 3 6 + 1 2 6 1 = 5 N − 5 6 + 5 N + 5 6 1 2 6 1 . For the latter to be an integer, ( 5 N + 5 6 ) ∣ 1 2 6 1 = 1 3 × 9 7 . The only divisors of 1 2 6 1 which are congruent to 5 6 m o d 5 are 1 and 1 2 6 1 . If 5 N + 5 6 = 1 then N = − 1 1 < 0 . So, 5 N + 5 6 = 1 2 6 1 is the only possibility, and N = 2 4 1 , 5 N + 5 6 N 2 − 7 5 = 4 6 .
Let 5 N + 5 6 N 2 − 7 5 = k for some integer k. N 2 − 7 5 = 5 N k + 5 6 k . N 2 − 5 N k − 7 5 − 5 6 k = 0 . N = 2 5 k ± 2 5 k 2 + 2 2 4 k + 3 0 0 . Now because N is a positive integer 2 5 k 2 + 2 2 4 k + 3 0 0 must be a perfect square. It is easy to see that ( 5 k + 1 7 ) 2 < 2 5 k 2 + 2 2 4 k + 3 0 0 < ( 5 k + 2 3 ) 2 .
Now if 2 5 k 2 + 2 2 4 k + 3 0 0 = ( 5 k + 1 8 ) 2 . k = 1 1 6 which is not an integer. Similarly for 2 5 k 2 + 2 2 4 k + 3 0 0 = ( 5 k + 1 9 ) 2 o r ( 5 k + 2 0 ) 2 o r ( 5 k + 2 1 ) 2 we don"t get an integer value of k. But for 2 5 k 2 + 2 2 4 k + 3 0 0 = ( 5 k + 2 2 ) 2 we get k=46 and therefore N = 2 2 3 0 ± ( 5 ∗ 4 6 + 2 2 ) . N = − 1 1 o r N = 2 4 1 . but given that N is a positive integer therefore N = 2 4 1 .
I don't know if I was supposed to solve in this way, but I could easily calculate the solution using java:
public static void main(String[] args) {
int i;
double a;
for (i = 0; i <= 1000; i++){
a = (Math.pow(i, 2) - 75)/(5*i + 56);
if (a == (int)a){
System.out.println(i);
}
}
}
The output of the program was: 241.
suppose 5 n + 5 6 N 2 − 7 5 = y
N 2 − 7 5 = 5 y N + 5 6 y N 2 − 5 y N − 5 6 y − 7 5 = 0
N 1 , 2 = 2 5 y ± 2 5 y 2 + 2 2 4 y + 3 0 0
suppose y = 2 a N 1 , 2 = 5 a ± 2 5 a 2 + 1 1 2 a + 7 5
suppose again 2 5 a 2 + 1 1 2 a + 7 5 = k 2 5 a 2 + 1 1 2 a + 7 5 = k 2 ( k − 5 a ) ( k + 5 a ) = 1 1 2 a + 7 5 from here we can get
a = 2 3 and k = ± 1 2 6
subtitution to N N 1 , 2 = 5 a ± 2 5 a 2 + 1 1 2 a + 7 5 N 1 , 2 = 5 . 2 3 ± 1 2 6 N 1 = 2 4 1 N 2 = − 1 1 ( Not possible because N is integer )
so the answer is 2 4 1
suppose 5 n + 5 6 N 2 − 7 5 = y
N 2 − 7 5 = 5 y N + 5 6 y N 2 − 5 y N − 5 6 y − 7 5 = 0
N 1 , 2 = 2 5 y ± 2 5 y 2 + 2 2 4 y + 3 0 0
suppose y = 2 a N 1 , 2 = 5 a ± 2 5 a 2 + 1 1 2 a + 7 5
suppose again 2 5 a 2 + 1 1 2 a + 7 5 = k 2 5 a 2 + 1 1 2 a + 7 5 = k 2 ( k − 5 a ) ( k + 5 a ) = 1 1 2 a + 7 5 from here we can get
a = 2 3 and k = ± 1 2 6
subtitution to N N 1 , 2 = 5 a ± 2 5 a 2 + 1 1 2 a + 7 5 N 1 , 2 = 5 . 2 3 ± 1 2 6 N 1 = 2 4 1 N 2 = − 1 1 ( Not possible because N is integer )
so the answer is 2 4 1
(N^2-75)=0.4{(5N+56)(5N-56)+1261} Take, 5N+56=1261 which gives N=241 and it is less than 1000, positive integer. Taking test: (241 241-75)/(5 241+56)=46 So, value of N=241
5 N + 5 6 N 2 − 7 5
= 2 5 1 5 N + 5 6 ( 5 N + 5 6 ) ( 5 N − 5 6 ) + 1 2 6 1
from this fraction we know that (5N+56)(5N-56) divisible by 5N+56 and 1261 also divisible by 5N+56
1261= 1 3 × 9 7 = 1 × 1 2 6 1
5N+56 must be equal to positive factor of 1261 because we find N<1000 and N is positive integer.
so possible value of N is 241
Suppose 5 N + 5 6 N 2 − 7 5 = k ∈ Z . Rearranging this we get N 2 − 5 k N − 5 6 k = 7 5 , and it is easily verified that ( N + 5 6 / 5 ) ( N − 5 k − 5 6 / 5 ) = 7 5 − ( 5 6 / 5 ) 2 . Multiplying both sides by 2 5 we have ( 5 N + 5 6 ) ( 5 N − 2 5 k − 5 6 ) = − 1 2 6 1 = − 1 3 × 7 3 . So we see that if N is a solution, then if d = 5 N + 5 6 then d ∣ 1 3 × 9 7 , and then 5 ∣ ( d − 5 6 ) so d = 1 mod 5 . Clearly only divisors of 1 3 × 9 7 with this property are d = 1 or d = 1 2 6 1 . The first gives us N = − 1 1 which is negative, and the second gives us N = 2 4 1 . Plugging this back into the equation above gives us k = 4 6 . So 2 4 1 ∗ 5 + 5 6 2 4 1 2 − 7 5 = 4 6 ∈ Z . Thus the only solution is N = 2 4 1 .
By partial fraction,
N^2−75/5N+76
if u didn`t solve by partial fraction i will explain.....now m using shortcut
=1/25(5N−56+1261/(5N+56)).
we check that 1261=13⋅97(both primes)
now 5N+56/1261 must be integer so put 5N+56= 1261,
=> N=241 .
Indeed, now further we check put n=241 gives answer 46.....
Therefore 241 is the correct answer
Technique is basically Partial Fraction
Let k be the quotient. Rearranging into quadratic form:
N 2 − ( 5 k ) N + ( 7 5 − 5 6 k ) = 0
Using the method of completing the square , i.e. transforming x 2 + p x + q into ( x + 2 p ) 2 − 4 p 2 + q , we get:
( N − 2 5 k ) 2 − 4 2 5 k 2 − 7 5 + 5 6 k = 0
Multiply by 2 2 to remove the fractions:
( 2 N − 5 k ) 2 = 2 5 k 2 + 2 2 4 k + 3 0 0
Now we can complete the square on the right-hand side:
( 2 n − 5 k ) 2 = ( 5 k + 2 2 . 4 ) 2 − ( 2 2 . 4 ) 2 + 3 0 0
and again multiply through by 5 2 to remove fractions:
( 1 0 N − 2 5 k ) 2 = ( 2 5 k + 1 1 2 ) 2 − 1 1 2 2 + 7 5 0 0
Rearranging:
( 2 5 k + 1 1 2 ) 2 − ( 1 0 N − 2 5 k ) 2 = 5 0 4 4
Using the identity a 2 − b 2 = ( a + b ) ( a − b ) and factorising 5 0 4 4 :
( 1 1 2 + 1 0 N ) ( 1 1 2 − 1 0 N + 5 0 k ) = 2 ∗ 2 ∗ 1 3 ∗ 9 7
Note that these two factors differ by 5 0 k − 2 0 N , a multiple of 10.
The only factorization of 2 ∗ 2 ∗ 1 3 ∗ 9 7 in which the two factors differ by a multiple of 10 is 2 ∗ 2 5 2 2 .
This gives us 1 1 2 + 1 0 N = 2 5 2 2 , i.e. N = 2 4 1 .
Final note: This proves that there are no solutions except for potentially N = 2 4 1 . To complete the proof we do need to actually verify that N = 2 4 1 solves the problem.
This is easily done and we find 4 6 = 5 ∗ 2 4 1 + 5 6 2 4 1 2 − 7 5
Let the given fraction equal some k ∈ Z . Then N 2 − 7 5 = 5 N k + 5 6 k , or
N 2 − 5 N k − 7 5 − 5 6 k = 0 --- ( i ) which has integer root(s) for N so it's discriminant is a perfect square i.e.
2 5 k 2 + 2 2 4 k + 3 0 0 = p 2 --- ( i i ) for some p ∈ Z + which again has integer root(s) for k so it's discriminant is a perfect square i.e.
2 2 4 2 − 3 0 0 0 0 + 1 0 0 p 2 = n 2 for some n ∈ Z +
⟹ ( n − 1 0 p ) ( n + 1 0 p ) = 2 0 1 7 6 --- ( i i i )
Now from -- ( i i ) we have k = 5 0 − 2 2 4 ± n --- ( i v )
Since k is an integer last two digits of k should be one of 2 4 , 7 4 , 2 6 , 7 6 . Using this and manually trying out the different possible factorizations of -- ( i i i ) ( There are only three possible factorizations to try out ) we find ( n − 1 0 p , n + 1 0 p ) = ( 4 , 5 0 4 4 ) ⟹ ( n , p ) = ( 2 5 2 4 , 2 5 2 ) .
From ( i v ) , we get k = 4 6 ( Rejecting the non-integral root ) . From -- ( i ) we obtain N = 2 4 1 as our answer.
Using the notation a ∣ b for a divides b , we need to find N where ( 5 N + 5 6 ) ∣ N 2 − 7 5 . We use a ∣ b ⇒ a ∣ k b and a ∣ b ⇔ a ∣ b + k a to make this more approachable. by removing all coefficients of N from the right side.
( 5 N + 5 6 ) ∣ N 2 − 7 5 ⇒ ( 5 N + 5 6 ) ∣ 5 ( N 2 − 7 5 ) = 5 N 2 − 3 7 5 ⇔ ( 5 N + 5 6 ) ∣ ( 5 N 2 − 3 7 5 ) − N ( 5 N + 5 6 ) = − 5 6 N − 3 7 5 ⇒ ( 5 N + 5 6 ) ∣ 5 ( − 5 6 N − 3 7 5 ) = − 2 8 0 N − 1 8 7 5 ⇔ ( 5 N + 5 6 ) ∣ ( − 2 8 0 N − 1 8 7 5 ) + 5 6 ( 5 N + 5 6 ) = 5 6 ⋅ 5 6 − 1 8 7 5 = 1 2 6 1 s o ( 5 N + 5 6 ) ∣ 1 2 6 1
At the stages where the right hand side has been multiplied up by 5 , the implication only works in one direction. The direction means that every solution of the original is captured in the derived equation, but that not every solution to the derived one is also a solution to the original.
Now we have that 5 N + 5 6 is a factor of 1 2 6 1 = 1 3 × 9 7 . The only possible (positive) factors are then 1 , 1 3 , 9 7 , 1 2 6 1 , and only 1 2 6 1 gives a positive integer value of N - 2 4 1 . This has to be checked with the original, and indeed 5 ⋅ 2 4 1 + 5 6 2 4 1 2 − 7 5 = 4 6 .
One note here is that this implies the restriction N < 1 0 0 0 is irrelevant, as this is the only solution possible.
By partial fraction ,N^2−75/5N+76 if u didt solve by partial fraction i will explain.....now m using shortcut =1/25(5N−56+1261/(5N+56)). we check that 1261=13⋅97(both primes) now 5N+56/1261 must be integer so put 5N+56= 1261,=> N=241 .Indeed, now further we check put n=241 gives answer 46.....technique is basically partial fraction
Let M = 5 N + 5 6 N 2 − 7 5 be an integer. Then C = N − 5 M is also an integer, and we can write 5 N + 5 6 N 2 − 7 5 = 5 N − C . Cross-multiplying, we get 5 N 2 − 3 7 5 = 5 N 2 + ( 5 6 − 5 C ) N − 5 6 C , so ( 5 6 − 5 C ) N = 5 6 C − 3 7 5 . Since C is an integer, then 5 6 − 5 C is non-zero so we obtain N = 5 6 − 5 C 5 6 C − 3 7 5 . We know that N is positive, so the numerator and denominator must either be both positive or both negative. Since C is an integer, we have 5 6 C − 3 7 5 < 0 ⇔ C ≤ 6 and 5 6 − 5 C < 0 ⇔ C ≥ 1 2 . Thus, we cannot have both being negative simultaneously and hence both must be positive. So 7 ≤ C ≤ 1 1 . Also, since N is an integer, we have ( 5 6 − 5 C ) ∣ ( 5 6 C − 3 7 5 ) and thus ( 5 6 − 5 C ) ∣ [ ( 5 6 C − 3 7 5 ) + 1 1 ( 5 6 − 5 C ) ] , or ( 5 6 − 5 C ) ∣ ( C + 2 4 1 ) . We shall now do casework on C = 7 , 8 , 9 , 1 0 , 1 1 to see which works. If C is even, then 5 6 − 5 C is even but C + 2 4 1 is odd; so C is odd. If C = 7 , then 3 divides 5 6 − 5 C = 2 1 but does not divide C + 2 4 1 = 2 4 8 . If C = 9 , then 5 6 − 5 C = 1 1 does not divide C + 2 4 1 = 2 5 0 . The only C left is 1 1 , and indeed, 5 6 − 5 C = 1 divides 1 1 + 2 4 1 = 2 5 2 . So N = 5 6 − 5 ( 1 1 ) 5 6 ( 1 1 ) − 3 7 5 = 2 4 1 .
(N^2-75)/(5N+76) is an integer so we can consider (N^2 - 75)/(5N + 56)=a (a is a positive integer)
We have the following equation: N^2 - 75 = a(5N + 56) <=> N^2 - 5aN - 75 - 56a = 0 (1)
This equation has integer roots; therefore Delta must equal b^2 (b is a positive integer)
=> (5a)^2 + 4.56a + 4.75 = b^2 <=> (25a)^2 + 100.56a + 100.75 = (5b)^2 <=> (25a+112)^2 - (5b)^2 = 5044 (2)
By solving (2) we have a=46, b=252 (after eliminating unsatisfied roots)
=> (1) <=> N^2 - 230N - 2651 = 0 <=> N = 241
(N^2-75)/(5N+56)=k, we first multiple by 5 so (5N^2-375)/(5N+56)=5k euclid, 5N^2-375=(5N+56)(N-12)+4N+297 look that 5N+56 not multiplication of 5 so 5N+56=4N+297 then \Box {N=241}
5 n + 5 6 n 2 − 7 5 is an integer ⇒ ( n 2 − 7 5 ) ⋮ ( 5 n + 5 6 ) ⇒ 2 5 ( n 2 − 7 5 ) ⋮ ( 5 n + 5 6 ) ⇒ ( 5 n + 5 6 ) 2 − 2 ⋅ 5 6 ( 5 n + 5 6 ) + 1 2 6 1 ⋮ ( 5 n + 5 6 ) ⇒ 1 2 6 1 ⋮ ( 5 n + 5 6 ) and 1 2 6 1 = 1 3 ⋅ 9 7 ⇒ 5 n + 5 6 = 1 3 or 5 n + 5 6 = 9 7 or 5 n + 5 6 = 1 2 6 1 ⇒ n = 2 4 1
We need 5 N + 5 6 ∣ N 2 − 7 5 , i.e. there exists a such that a ( 5 N + 5 6 ) = N 2 − 7 5 . Write it as quadratic in N to get $$N^2 - 5aN - 56a - 75 = 0$$ This has solution $$N = \frac{\pm \sqrt{25a^2 + 224a + 300} + 5a}{2}$$ So it is necessary to have $$25a^2 + 224a + 300 = x^2$$ for some x . Now note that $$(5a + 23)^2 > 25a^2 + 224a + 300 > (5a + 17)^2$$ i.e. x is equal to one of 5 a + 1 8 , 5 a + 1 9 , … , 5 a + 2 2 . It is easily found that only x = 5 a + 2 2 yields integral solution $$a = 46$$ Plugging a = 4 6 into $$N = \frac{\pm \sqrt{25a^2 + 224a + 300} + 5a}{2}$$ yields N = − 1 1 or N = 2 4 1 , so $$N = \boxed{241}$$
first. equate it to x, where x is a positive integer..
N 2 - 75 = 5xN + 56x to equate it to zero, transpose..
N 2 - 5xN - (75+56x) = 0 using the quadratic formula, [ \frac{[5x +- \sqrt{ \( 25x^{2} + 224x + 300] }{2} ]
we'll now find the values of x that give the discriminant positive.. and from that domain, we'll be able to find that the equation is a perfect square (so that means one solution only) which is 241
5n + 56 | n 2 - 75
5n + 56 | 5( n 2 - 75)
5n + 56 | 5 n 2 + 56n - 56n - 5*75
5n + 56 | n(5n + 56) - 56n - 5 * 75
5n + 56 | -56n - 5 * 75 => 5n + 56 | 56n + 5 * 75
5n + 56 | 5(56n + 5 * 75)
5n + 56 | 5*56n + 56 * 56 - 56 * 56 + 5 * 5 * 75
5n + 56 | 56(5n + 56) + 5 5 75 - 56*56 => 5n + 56 | -1261 => 5n + 56 | 1261
1261 = 13 * 97 => 5n + 56 = 97 or 5n + 56 = 1261
Do long division. You get that 5 N + 5 6 N 2 − 7 5 = 2 5 1 ( 5 N − 5 6 + 5 N + 5 6 1 2 6 1 ) Now, 1 2 6 1 = 1 3 ⋅ 9 7 , and so the only factor of 1261 that can be expressed as 5 N + 5 6 is 1261, so N = 2 4 1 . This works, so the answer is 2 4 1 .
Problem Loading...
Note Loading...
Set Loading...
Use long division, we can analyse the fraction:
5 N + 5 6 N 2 − 7 5 = 2 5 ( 5 N + 5 6 ) ( 5 N + 5 6 ) ( 5 N − 5 6 ) + 1 2 6 1 = 2 5 5 N − 5 6 + ( 5 N + 5 6 ) 1 2 6 1
Thus, 5 N + 5 6 must be a divisor of 1 2 6 1 , so it's an element of { − 1 2 6 1 , − 9 7 , − 1 3 , − 1 , 1 , 1 3 , 9 7 , 1 2 6 1 } . So the value of N must be 2 4 1 (other cases cause N negative or not natural), and with N = 2 4 1 , the fraction is an integer.
Therefore, the solution of the problem is 2 4 1 .