Counting Restricted Integers

For how many ordered pairs of positive integers ( a , b ) (a, b) are the following conditions satisfied?

  1. gcd ( a , b ) > 3 \gcd(a,b) > 3

  2. a + b = 104 a+b=104


The answer is 31.

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.

5 solutions

Alex Alex
Dec 25, 2013

There are 103 103 ordered pairs of positive intergers such that a + b = 104 a+b = 104 .

g c d ( a , b ) = g c d ( a , a + b ) = g c d ( b , a + b ) gcd(a, b) = gcd(a, a+b) = gcd(b, a+b)

if g c d ( a , b ) = 1 = > g c d ( a , a + b ) = 1 = > g c d ( a , 104 ) = 1 gcd(a, b) = 1 => gcd(a, a+b) = 1 => gcd(a, 104) = 1 There are ϕ ( 104 ) \phi(104) numbers a a satisfying this condition, where ϕ ( n ) \phi(n) - Euler's function. If we choose some a a then b b is defined automatically. So there are ϕ ( 104 ) = ϕ ( 2 3 × 13 ) = ( 2 3 2 2 ) ( 13 1 ) = 48 \phi(104) = \phi(2^3\times13) = (2^3-2^2)*(13-1) = 48 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 , 52 ) = 1 gcd(a, b) = 2 => gcd(a/2, b/2) = 1 => gcd(a/2, (a+b)/2) = 1 => gcd(a/2, 52) = 1 There are ϕ ( 52 ) \phi(52) numbers a / 2 a/2 (and a a ) sutisfying this condition. So there are ϕ ( 52 ) = ϕ ( 2 2 × 13 ) = ( 2 2 2 ) ( 13 1 ) = 24 \phi(52) = \phi(2^2\times13) = (2^2-2)*(13-1) = 24 pairs.

if g c d ( a , b ) = 3 = > gcd(a, b) = 3 => a a is divided by 3 3 and b b is divided by 3 = > ( a + b ) 3 => (a + b) is divided by 3 = > 104 3 => 104 is divided by 3 3 . Contradiction. Therefore there are not pairs ( a , b ) (a, b) such that g c d ( a , b ) = 3 gcd(a, b) = 3 .

The other pairs satisfy the condition.

So answer is equal to 103 48 24 = 31 103 - 48 - 24 = \boxed{31}

Nice!

Jit Ganguly - 7 years, 3 months ago
Sean Elliott
Dec 25, 2013

Divide equation (2) by gcd ( a , b ) \text{gcd}(a,b) to obtain 104 gcd ( a , b ) = a gcd ( a , b ) + b gcd ( a , b ) = ( integer ) + ( integer ) gcd ( a , b ) 104 \frac{104}{\text{gcd}(a,b)}=\frac{a}{\text{gcd}(a,b)}+\frac{b}{\text{gcd}(a,b)}=(\text{integer})+(\text{integer})\Rightarrow \text{gcd}(a,b)|104 .

The prime factorization of 104 104 is 2 3 1 3 1 2^313^1 . However, gcd ( a , b ) > 3 \text{gcd}(a,b)>3 , so it must be 4 , 8 , 13 , 26 , 4,8,13,26, or 52 52 , This means any gcd ( a , b ) \text{gcd}(a,b) that is a multiple of 4 4 or 13 13 will work. Thus the ordered pairs are the multiples of 4 4 and 13 13 from 1 1 to 52 52 ; there are precisely 13 + 4 1 = 16 13+4-1=16 integers, so 2 16 1 = 31 2\cdot16-1=\boxed{31} ordered pairs.

Pratik Vora
Dec 25, 2013

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

Gaurav Sharma - 7 years, 5 months ago

Log in to reply

Gaurav Sharma, In d first case a=26;b=72 & in second case a=72;b=26

Ritwik Sain - 7 years, 5 months ago
Adit Mohan
Jan 10, 2014

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.



Budi Utomo
Dec 25, 2013

{(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

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...