If
b
a
is an irreducible fraction such that
{ 0 < b a < 1 a + b = 1 0 0 0
How many possibilities are there for the value of b a ?
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.
Awesome and beautiful.
Log in to reply
I used the same method except I forgot to add ⌊ 1 0 4 9 9 ⌋
Log in to reply
That is completely alright!! These things happen to all of us!!
Clearly,
b
a
=
1
0
0
0
−
a
a
. Now the fraction is irreducible iff,
g
c
d
(
a
,
1
0
0
0
−
a
)
=
g
c
d
(
a
,
1
0
0
0
)
=
1
.
Since,
ϕ
(
1
0
0
0
)
=
4
0
0
there are
4
0
0
such
a
that
b
a
is irreducible. However, for only half of these
a
<
b
.
Hence, the answer is 2 0 0 .
Problem Loading...
Note Loading...
Set Loading...
Notice that b a is reducible with the given conditions if and only if a is congruent to zero modulo 2 or 5 . (Because 1 0 0 0 = 2 3 5 3 )
Now, we want to find the number of fractions 1 0 0 0 − a a such that a is not divisible by two or five and 0 < 1 0 0 0 − a a < 1 . This is just finding the number of integers a from 1 to 4 9 9 , inclusive, so that a is not divisible by two or five.
We subtract the number of multiples of two and five from the total, and add back the double counted numbers: 4 9 9 − ⌊ 2 4 9 9 ⌋ − ⌊ 5 4 9 9 ⌋ + ⌊ 1 0 4 9 9 ⌋ = 2 0 0 . So we have 2 0 0 irreducible fractions that satisfy the conditions.
Another way to do this would be to notice that not being divisible by two or five is actually periodic in groups of 1 0 , and go from there.