For how many ordered pairs of positive integers ( a , b ) are the following conditions satisfied?
g cd ( a , b ) > 3
a + b = 1 0 4
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.
Nice!
Divide equation (2) by gcd ( a , b ) to obtain gcd ( a , b ) 1 0 4 = gcd ( a , b ) a + gcd ( a , b ) b = ( integer ) + ( integer ) ⇒ gcd ( a , b ) ∣ 1 0 4 .
The prime factorization of 1 0 4 is 2 3 1 3 1 . However, gcd ( a , b ) > 3 , so it must be 4 , 8 , 1 3 , 2 6 , or 5 2 , This means any gcd ( a , b ) that is a multiple of 4 or 1 3 will work. Thus the ordered pairs are the multiples of 4 and 1 3 from 1 to 5 2 ; there are precisely 1 3 + 4 − 1 = 1 6 integers, so 2 ⋅ 1 6 − 1 = 3 1 ordered pairs.
104=2^3 * 13 As we want GCD > 3 we take all multiples of 4,8,13 and their corresponding pairs.
Therefore multiples of 4 are from 4-100 i.e 25 pairs.((52,52) is a common pair)
Multiples of 13 are 13-91 i.e 6 pairs ((52,52) already taken)
So total pairs=25+6=31
i think 26-72 & 72-26 are counted twice .......maybe correct answer is 29
Log in to reply
Gaurav Sharma, In d first case a=26;b=72 & in second case a=72;b=26
gcd(a,b) will be a factor of 104. thus possible gcds are 4,8,13,26,52.
let gcd = n a/n,b/n are coprime a/n+b/n=104/n.
for n = 4,8,13,26,52 we can count no of coprime nos that add up to 104/n.
{for ex for n=13 we have 104/n = 8 coprime pairs are (1,7) (3,5) (7,1) (5,3)}.
there are 31 such pairs.
{(100,4),(96,8),(92,12),(91,13),(88,16),(84,20),(80,24),(78,26),(72,32),(68,36),(65,39),(60,44),(56,48),(64,40),(76,28)}x2 + (52,52) = 15 x 2 + 1 = 30 + 1 = 31. Answer : 31
Problem Loading...
Note Loading...
Set Loading...
There are 1 0 3 ordered pairs of positive intergers such that a + b = 1 0 4 .
g c d ( a , b ) = g c d ( a , a + b ) = g c d ( b , a + b )
if g c d ( a , b ) = 1 = > g c d ( a , a + b ) = 1 = > g c d ( a , 1 0 4 ) = 1 There are ϕ ( 1 0 4 ) numbers a satisfying this condition, where ϕ ( n ) - Euler's function. If we choose some a then b is defined automatically. So there are ϕ ( 1 0 4 ) = ϕ ( 2 3 × 1 3 ) = ( 2 3 − 2 2 ) ∗ ( 1 3 − 1 ) = 4 8 pairs.
if g c d ( a , b ) = 2 = > g c d ( a / 2 , b / 2 ) = 1 = > g c d ( a / 2 , ( a + b ) / 2 ) = 1 = > g c d ( a / 2 , 5 2 ) = 1 There are ϕ ( 5 2 ) numbers a / 2 (and a ) sutisfying this condition. So there are ϕ ( 5 2 ) = ϕ ( 2 2 × 1 3 ) = ( 2 2 − 2 ) ∗ ( 1 3 − 1 ) = 2 4 pairs.
if g c d ( a , b ) = 3 = > a is divided by 3 and b is divided by 3 = > ( a + b ) is divided by 3 = > 1 0 4 is divided by 3 . Contradiction. Therefore there are not pairs ( a , b ) such that g c d ( a , b ) = 3 .
The other pairs satisfy the condition.
So answer is equal to 1 0 3 − 4 8 − 2 4 = 3 1