Let x < y be positive integers such that g cd ( x , y ) = 1 . We define
f ( x , y ) = 1 0 0 ⌊ y x × 1 0 0 ⌋
What is the greatest integer G , such that for any x 1 , x 2 , y 1 , y 2 ≤ G satisfying x 1 = x 2 , y 1 = y 2 , we have
f ( x 1 , y 1 ) = f ( x 2 , y 2 ) ?
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.
If there is a restriction that all x 1 , x 2 , y 1 , y 2 are unique we must look further: b = 1 2 only offers 1 2 1 0 0 = 0 8 , 1 2 5 0 0 = 4 1 , 1 2 7 0 0 = 5 8 , 1 2 1 1 0 0 = 9 1 .
b = 1 3 b r i n g s 0 7 , 1 5 , 2 3 , 3 0 ∗ , 3 8 , 4 6 , 5 3 , 6 1 , 6 9 , 7 6 , 8 4 , 9 2 with
⌊ 1 0 0 1 3 4 ⌋ = ⌊ 1 0 0 1 0 3 ⌋ = 3 0 .
Problem Loading...
Note Loading...
Set Loading...
⌊ 1 0 0 b a ⌋ b a 1 2 3 4 5 6 7 8 9 1 0 2 5 0 3 3 3 6 6 4 2 5 7 5 5 2 0 4 0 6 0 8 0 6 1 6 8 3 7 1 4 2 8 4 2 5 6 7 1 8 5 8 1 2 3 7 6 2 8 7 9 1 1 2 2 4 4 5 5 7 7 8 8 1 0 1 0 3 0 7 0 9 0 ∗ 1 1 0 9 1 8 2 7 3 6 4 5 5 4 6 3 7 2 8 1 9 0 ∗
⌊ 1 0 0 1 0 9 ⌋ = ⌊ 1 0 0 1 1 1 0 ⌋ = 9 0 is the first duplicate.