How many pairs satisfy the above equation, where is a positive integer and is a non-integer rational number such that ?
Notation : denotes the fractional part function .
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.
since we are given q is non integer, we easily deduce 2 0 0 0 n ! is non integer. but for n≥ 15 it will always be an int. hence,we have to check the 1 ->14. what is fractional part, it is just 2 0 0 0 n ! ( m o d 2 0 0 0 ) we search for mod by multiplying to the las number 1 1 ! 2 ! 3 ! 4 ! 5 ! 6 ! 7 ! 8 ! 9 ! 1 0 ! 1 1 ! 1 2 ! 1 3 ! 1 4 ! ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ 1 1 ∗ 2 2 ∗ 3 6 ∗ 4 2 4 ∗ 5 1 2 0 ∗ 6 7 2 0 ∗ 7 4 0 ∗ 8 3 2 0 ∗ 9 8 8 0 ∗ 1 0 8 0 0 ∗ 1 1 8 0 0 ∗ 1 2 1 6 0 0 ∗ 1 3 8 0 0 ∗ 1 4 ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ 1 2 6 2 4 1 2 0 7 2 0 4 0 3 2 0 8 8 0 8 0 0 8 0 0 1 6 0 0 8 0 0 1 2 0 0 ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) ( m o d 2 0 0 0 ) we see that q must be rational ,so must its fractional part for which 2 0 0 0 n ! ( m o d 2 0 0 0 ) must be rational. we see that only 6 and 8 satisfies this each producing 2000 q, hence we have 2 ∗ 2 0 0 0 = 4 0 0 0 solutions. namely ( 6 , 0 . 6 ) , ( 6 , 1 . 6 ) . . . . ( 6 , 1 9 9 9 . 6 ) a n d ( 8 , 0 . 4 ) , ( 8 , 1 . 4 ) . . . . . ( 8 , 1 9 9 9 . 4 )