For how many (not necessarily positive) integer values of n is the value of 4 0 0 0 ⋅ ( 5 2 ) n an integer?
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.
Note for 4 0 0 0 ( 5 2 ) n the denominator of ( 5 2 ) n must cancel with 4000.
Trivially we get n = 0 ⇒ 4 0 0 0 ( 5 2 ) n = 4 0 0 0
Since 4 0 0 0 = 2 5 ⋅ 5 3 then if n is positive, then 5 n must cancel with 5 3 , it follows n ≤ 3 [ [ n ∈ N ] ] .
If n is negative, then 2 n must cancel with 2 5 , it follows n ≥ − 5 [ [ n ∈ N ] ] .
Note if n is not an integer, ( 5 2 ) n Is irrational.
Thus − 5 ≤ n ≤ 3 [ [ n ∈ N ] ] .
With 3 − ( − 5 ) + 1 = 9 solutions.
Problem Loading...
Note Loading...
Set Loading...
2 and 5 are coprime, so the numerator will not affect whether the expression is an integer. For example, no matter how many times a number is doubled, it will not change whether the product is divisible by 5 . Therefore, we will only consider the denominator.
If n is positive, the denominator will be a power of 5 . If n is negative, the denominator will be a power of 2 . 4 0 0 0 = 2 5 ⋅ 5 3 , so n may not exceed these exponents. Therefore, − 5 ≤ n ≤ 3 (including 0 ), so there are 3 − ( − 5 ) + 1 = 9 possible values of n .