Find the smallest positive integer N = 2 3 such that the fraction 7 N + 6 N − 2 3 is not in simplest terms.
Details and assumptions
A fraction b a is in simplest terms if a and b are coprime integers.
As a specific example, the fraction 4 6 is not in simplest terms since g cd ( 4 , 6 ) = 2 = 1 . It can be simplified to 2 3 .
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.
Solution 1: Denote N − 2 3 by M . Then 7 N + 6 = 7 ( M + 2 3 ) + 6 = 7 M + 1 6 7 . If some prime p divides both M and 7 M + 1 6 7 , it must divide 1 6 7 . Because 1 6 7 is prime, p must equal 1 6 7 , which happens if and only if M = N − 2 3 is a multiple of 1 6 7 . Since N is positive and different from 2 3 , the smallest such M is 1 6 7 . This gives N = 1 6 7 + 2 3 = 1 9 0 .
Solution 2: We have that g cd ( N − 2 3 , 7 N + 6 ) = g cd ( ( N − 2 3 ) + 6 ( N − 2 3 ) , 7 N + 6 ) = g cd ( 7 N − 1 6 1 − ( 7 N + 6 ) , 7 N + 6 ) = g cd ( 1 6 7 , 7 N + 6 )
Since 1 6 7 is prime, the greatest common divisor is either 1 6 7 or 1 . If it is 1 then the fraction would be simplified, thus it must be 1 6 7 .
So, the smallest possible value for the numerator is 1 6 7 , hence N = 1 6 7 + 2 3 = 1 9 0 is the smallest possible value for N .
We check that the fraction is not reduced when N = 1 9 0 : 7 N + 6 N − 2 3 = 1 6 7 × 8 1 6 7 .
from the problem we know gcd(N-23,7N+6)=gcd(7N+6,23×7+6)>1 as 23×7+6=167 is a prime. so (7N+6) mod 167=0,7N+6=167x, (167x-6) mod 7=0. as 167 mod 7=6. we get (6x-6)mod 7=0,and x=1 , N=23 is illegal. so min solution for x is 1+7=8. so min solution for N is (167×8-6)/7.
Problem Loading...
Note Loading...
Set Loading...
We know that the fraction 7 N + 6 N − 2 3 will not be in lowest terms when the greatest common divisor (gcd) of N − 2 3 and 7 N + 6 is greater than 1. We note that 7 N + 6 = 7 ( N − 2 3 ) + 1 6 7 which implies that g cd ( N − 2 3 , 7 N + 6 ) ∣ 1 6 7 However, 167 is prime so both the numerator and denominator must be divisible by 167 in order for the fraction to not be in simplest form. Also, because N − 2 3 must be divisible by 167, N must be congruent to 23 mod 167. So the smallest value of N congruent to 23 mod 167 is 190(because N cannot equal 23)