Unsimplifying a Fraction

Find the smallest positive integer N 23 N \neq 23 such that the fraction N 23 7 N + 6 \frac {N-23} { 7N+6 } is not in simplest terms.

Details and assumptions

A fraction a b \frac{a}{b} is in simplest terms if a a and b b are coprime integers.

As a specific example, the fraction 6 4 \frac {6}{4} is not in simplest terms since gcd ( 4 , 6 ) = 2 1 \gcd(4, 6) = 2 \neq 1 . It can be simplified to 3 2 \frac {3}{2} .


The answer is 190.

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.

3 solutions

Apoorva Shah
May 20, 2014

We know that the fraction N 23 7 N + 6 \frac{N-23}{7N+6} will not be in lowest terms when the greatest common divisor (gcd) of N 23 N-23 and 7 N + 6 7N+6 is greater than 1. We note that 7 N + 6 = 7 ( N 23 ) + 167 7N+6= 7(N-23)+167 which implies that gcd ( N 23 , 7 N + 6 ) 167 \gcd(N-23,7N+6)\mid167 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 23 N-23 must be divisible by 167, N N must be congruent to 23 mod 167. So the smallest value of N N congruent to 23 mod 167 is 190(because N N cannot equal 23)

No completely correct solution was received.

What minor detail is missing in the featured solution?

Calvin Lin Staff - 7 years ago
Calvin Lin Staff
May 13, 2014

Solution 1: Denote N 23 N-23 by M . M. Then 7 N + 6 = 7 ( M + 23 ) + 6 = 7 M + 167. 7N+6= 7(M+23)+6=7M+167. If some prime p p divides both M M and 7 M + 167 , 7M+167, it must divide 167. 167. Because 167 167 is prime, p p must equal 167 , 167, which happens if and only if M = N 23 M=N-23 is a multiple of 167. 167. Since N N is positive and different from 23 , 23, the smallest such M M is 167. 167. This gives N = 167 + 23 = 190. N=167+23=190.

Solution 2: We have that gcd ( N 23 , 7 N + 6 ) = gcd ( ( N 23 ) + 6 ( N 23 ) , 7 N + 6 ) = gcd ( 7 N 161 ( 7 N + 6 ) , 7 N + 6 ) = gcd ( 167 , 7 N + 6 ) \begin{aligned} \gcd(N-23, 7N+ 6) & = \gcd((N-23)+6(N-23), 7N+6) \\ & = \gcd(7N-161 - (7N+6), 7N+6) \\ & = \gcd(167, 7N+6) \\ \end{aligned}

Since 167 167 is prime, the greatest common divisor is either 167 167 or 1 1 . If it is 1 1 then the fraction would be simplified, thus it must be 167 167 .

So, the smallest possible value for the numerator is 167 167 , hence N = 167 + 23 = 190 N=167+23=190 is the smallest possible value for N N .

We check that the fraction is not reduced when N = 190 N = 190 : N 23 7 N + 6 = 167 167 × 8 \frac {N-23}{7N+6} = \frac {167}{167 \times 8} .

Ryandk St
May 20, 2014

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.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...