Find the number of 6 -term strictly increasing geometric progressions, such that all terms are positive integers less than 1 0 0 0 .
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.
All correct solutions were similar to this one and to the intended one. There were two common mistakes: overlooking the possibility of rational common ratio, and failing to use the fact that all terms are integers to show that the first term must be a multiple of the fifth power of the denominator of the common ratio.
For this problem, we can represent the geometric sequence as:
r a 5 , r a 4 b , r a 3 b 2 , r a 2 b 3 , r a b 4 , r b 5
Since 4 5 = 1 0 2 4 , we know that b < 4 .
We also know that a < b because the sequence is strictly increasing.
For a = 1 and b = 2 , there are 2 5 1 0 0 0 values of r ( r ranges from 1 to 3 1 ).
For a = 1 and b = 3 , there are 3 5 1 0 0 0 values of r ( r ranges from 1 to 4 ).
For a = 2 and b = 3 , there are 3 5 1 0 0 0 values of r ( r ranges from 1 to 4 ).
The sum of all of these is 3 9 .
Consider the progression starting with the term $a$, with a multiplicative factor of $r$. As the progression has 6 terms, the last term is $a*r^5$.
As all the terms must be integers, $a$ must be an integer. $r$ can be also an integer or a rational number.
Case 1: $r$ is integer.
Since the last term is $a*r^5$, and $a$ is an integer, $r^5$ must be less than 1000. $r$ can be 2 ($2^5$=32) or 3 ($3^5$=243), but cannot be 4 ($4^5$=1024). $r$ cannot be 1 because the progression is strictly increasing.
If $r$=2, $a$ can be any positive integer below 32, since $2^5$ 31=992 and $2^5$ 32=1024. Then, there are 31 progressions with $r$=2.
If $r$=3, $a$ must be less than 5. Then, there are 4 progressions with $r$=3.
Case 2: $r$ is rational.
Suppose that $r=\frac{p}{q}$, with gcd(p,q)=1. Then, $a r^5 = \frac{a p^5}{q^5}$, and therefore $a=k q^5$. Otherwise, the last term would not be integer. This means that the last term is $k p^5$, with $p$ integer, which reduces to the previous case.
$p$ cannot be 2, because $r>1$ (the progression is increasing).
If $p=3$, $q$ can be only 2. Then $a=k 2^5$, and the last term is $k 3^5$. As in the previous case, $k$ must be less than 5, so there are only 4 progressions.
To sum up, if the first term is $a$ each term is multiplied by $r$, the possibilities are:
In total, 31+4+4=39 possibilities.
Since it is strictly increasing progression, then the last term ar^5 must be less than 1000. The common ratio, r must be either integers or fractions.
Case 1: r is integer Smallest r would be 2, and since 4^5 = 1024 > 1000, so r can only be 2 and 3. For r=2, since ar^5 = 243a < 1000 \Rightarrow 1 \leq a \leq 31. Similarly for r=3, 1 \leq a \leq 4.
Case 2: r is fraction Let r= \frac {m}{n}. The last term become \frac {am^5}{n^5}. But since all terms are integers and \gcd(m,n)=1, a must be divisible by n^5, or a=kn^5. The last term now becomes km^5. As the progression is increasing, \frac {m}{n} > 1 \Rightarrow m > n. And n \neq 1 (so that r is not an integer) and km^5 < 1000, therefore n=2 and m=3 and 1 \leq k \leq 4. Total number of such progressions = 31+4+4 = 39
Suppose the first term of the progression is a and the ratio is r . Then a is a positive integer and r is a rational number with r > 1 . (Note that r does not have to be an integer.)
Suppose r = m n , where n and m have no common factors. The last term of the progression, a r 5 = m 5 a n 5 must be an integer. So m 5 divides a , thus a ≥ m 5 . Therefore, a r 5 ≥ m 5 m 5 n 5 = n 5 . Because a r 5 < 1 0 0 0 , this implies n 5 < 1 0 0 0 . Note that 4 5 = 1 0 2 4 , so n can only be 2 or 3 .
If n = 2 , then m = 1 (because r > 1 ). In this case the progression consists of numbers a , 2 a , . . . , 3 2 a . This works if and only if 1 ≤ a and 3 2 a < 1 0 0 0 , which is equivalent to 1 ≤ a ≤ 3 1 .
If n = 3 , then m = 1 or m = 2 . If m = 1 , then the progression consists of numbers a , 3 a , . . . , 2 4 3 a . This works if and only if 1 ≤ a and 2 4 3 a < 1 0 0 0 , which is equivalent to 1 ≤ a ≤ 4 .
If m = 2 , then, from the argument above, 2 5 must divide a , so a = 3 2 b for some integer b . In this case, the progression consists of the numbers 3 2 b , 4 8 b , 7 2 b , 1 0 8 b , 1 6 2 b , 2 4 3 b . This works if and only if 1 ≤ b and 2 4 3 b < 1 0 0 0 , which is equivalent to 1 ≤ b ≤ 4 .
Putting this all together, we have 3 1 + 4 + 4 = 3 9 geometric progressions.
Since 4^5 > 1000, we can say that common ratio has to be less than 4
If ratio is 2, then terms are a, 2a, 4a, 8a, 16a, 32a 32a < 1000 => a < 32 So, 31 different GP's
If ratio is 3, then terms are a, 3a, 9a, 27a, 81a, 243a 243a < 1000 a < 5 So, 5 different GP's
Now, ratio can also be 3/2, terms will be a, 3a/2, 9a/4, 27a/8, 81a/16, 243a/81 => a has to be a multiple of 81, say 81k => 243k < 1000 => k < 5 So, 4 more GP's
Now, if ratio is p/q, then q has to be 2 or 3 (as q^5 for integers more than 3 is more than 1000) In case of 2, p can be 3 or 4 (both are already considered) and no other number s possible (as then p^5 will exceed 1000) In case of 3, p has to be more than 3 (but for p > 3, p^5 will exceed 1000)
So, only 31 + 4 + 4 = 39 series are possible
Even the answer is wrong: 35, not 39. The fractional ratios are missing, the whole argument is very non-rigorous.
I don't think both the sentences match up. Can you have a look at the other solutions?
We have to find how many couples of integers ( a ; q ) are there such as a × q 5 ≤ 1 0 0 0 In fact, f = e × q = d × q 2 = c × q 3 = b × q 4 = a × q 5 , and f must be less or equal to 1000. We see that must be q 5 ≤ a 1 0 0 0 , so q can be 2 or 3 for 1 ≤ a ≤ 4 , and can be only 2 for 5 < a ≤ 3 1 . If a > 3 1 then q = 1 , but it can't be, because the progression must be strictly increasing. So, the number of couples ( a ; q ) is 4 × 2 + 3 1 = 3 9
Problem Loading...
Note Loading...
Set Loading...
First let us consider geometric progressions with common ratio r ∈ Z + (positive integers).
If r = 1 , then the sequence will not be increasing.
If r = 2 , then the first term a 1 must be less than 2 5 1 0 0 0 so that the final term (and therefore all terms) are less than 1 0 0 0 . 2 5 1 0 0 0 = 4 1 2 5 = 3 1 . 2 5 , so a 1 can be any positive integer from 1 to 3 1 . So far we have 3 1 distinct progressions defined by r = 2 and a 1 ∈ { 1 , 2 , 3 , . . . , 3 1 } .
If r = 3 , then a 1 must be less than 3 5 1 0 0 0 = 2 4 3 1 0 0 0 ≈ 4 . 1 , so a 1 can be any positive integer from 1 to 4 . We now have 3 1 + 4 = 3 5 progressions.
If r = 4 , then a 1 must be less than 4 5 1 0 0 0 = 1 0 2 4 1 0 0 0 < 1 , but a 1 must be a positive integer, so it can't be less than 1 , so there exist no progressions for r ≥ 4 because one of the terms would end up being greater than 1 0 0 0 .
If we let r ∈ Q (rational numbers), then we must be careful that all of the terms in the progression are positive integers. If r is of the form y x , then a 1 must be of the form k × y 5 , k ∈ Z + , so that the y term in the denominator of r will cancel for all six terms, leaving an integer. In addition, a 1 × r 5 = k × y 5 × ( y x ) 5 = k × x 5 must still be less than 1 0 0 0 . For this reason, x cannot be greater than or equal to 4 , so x can only be 2 or 3 . And because a 1 is of the form k × y 5 , which must also be less than 1 0 0 0 , y can only be 1 , 2 or 3 .
The case y = 1 is the positive integers covered above. For the remaining four possible values of of r = y x { 2 2 , 3 2 , 2 3 , 3 3 } , 2 2 = 3 3 = 1 and 3 2 cause a non-increasing sequence, so the only other possible rational value of r is 2 3 .
a 1 = k × y 5 = k × 2 5 = 3 2 k , must be less than r 5 1 0 0 0 = ( 3 / 2 ) 5 1 0 0 0 = 2 4 3 3 2 × 1 0 0 0 , so k must be less than 3 2 2 4 3 3 2 × 1 0 0 0 = 2 4 3 1 0 0 0 ≈ 4 . 1 . So k can be any positive integer from 1 to 4 . This gives us four progressions defined by r = 2 3 and a 1 ∈ { 2 5 , 2 × 2 5 , 3 × 2 5 , 4 × 2 5 } . Adding these 4 to the 3 5 accounted for before, we get 3 9 progressions.
We have now exhausted all possible values of r , so we have 3 9 progressions.