A sequence A is defined by A n = 1 . 2 5 n . For how many integer values of n with 0 ≤ n ≤ 1 0 0 0 , is A 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.
I think so 351 is the right answer according to you there are 251 multiples of 4 such that 0≤n≤1000 that is absolutely right but what about the 100 multiples of 10 this gives u the answer 251 + 100 = 351
Log in to reply
Consider n = 1 0 . 1 . 2 5 n = 1 2 . 5 , which is not an integer. To remove the 4 in the denominator, the number needs two 2's in the prime factorization.
you don't say, 10 is not the product of 4, but 100 is product of 4, adn if An=10>1,25 it becomes 12,5.
oops thanks for the solution i dont know it because i am still in grade 6
n must be divisible by 4 (because only 4 ⋅ 1 . 2 5 is an integer so 4 1 0 0 0 = 2 5 0 Then, we have to add 1 to account for 0, because n can be 0 and the 250 numbers are positive multiples of 4. Therefore, our answer is: 2 5 0 + 1 = 2 5 1
thanks :)
We can do this by A.P. also. we need the number of terms b/w 0 and 1000 divisible by 4. Therefore, 1000=0+(n-1)4 and we get n=251
yeah, i forget that 0 is one of them,,
But, 0 is not an integer.it comes under whole numbers Z (0,1,2,3,.......).if you take n=0, then An can not be an integer,,it'll be a whole number, which is also called as non-negative number..
We can write 1.25n as 5n/4. 5n/4 is integer only when n is a multiple of 4. Between 0 and 1000 there are 250 multiples of 4. ((1000/4)=250). And also 0 is multiple of every number. So, total 251 possibilties of n.
1.25n will only ever be an integer when n > 0 is a multiple of 4, so will only be an integer for quarter of the integers from 1 - 1000, giving us 250.
We can also count n = 0 as an answer, giving us 251 values of n, for which 1.25n is an integer..
We can write 1 . 2 5 n = ( 1 + 4 1 ) n = ( 4 5 ) n = 4 5 n . It is an integer iff 4 ∣ 5 n . But 4 ∤ 5 , so we need 4 ∣ n . This happens when n ∈ { 0 × 4 , 1 × 4 , . . . , 2 5 0 × 4 , a total of 2 5 1 possible values.
Because 1 n is always an integer we disregard that and focus on the 0 . 2 5 n . We see that 0 . 2 5 n is an integer every 4th number because 0 . 2 5 1 = 4 . 4 1 0 0 0 = 2 5 0 . We now have 2 5 0 values and also add 1 for n = 0 , the answer is 2 5 1
Problem Loading...
Note Loading...
Set Loading...
A n = 4 5 n This is an integer when 4 ∣ n (4 divides n ). There are 2 5 1 multiples of 4 such that 0 ≤ n ≤ 1 0 0 0 .