How many geometric progressions?

Find the number of 6 6 -term strictly increasing geometric progressions, such that all terms are positive integers less than 1000. 1000.


The answer is 39.

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.

8 solutions

Ricky Escobar
May 20, 2014

First let us consider geometric progressions with common ratio r Z + r \in \mathbb{Z^+} (positive integers).

If r = 1 r=1 , then the sequence will not be increasing.

If r = 2 r=2 , then the first term a 1 a_1 must be less than 1000 2 5 \frac{1000}{2^5} so that the final term (and therefore all terms) are less than 1000 1000 . 1000 2 5 = 125 4 = 31.25 \frac{1000}{2^5}=\frac{125}{4}=31.25 , so a 1 a_1 can be any positive integer from 1 1 to 31 31 . So far we have 31 31 distinct progressions defined by r = 2 r=2 and a 1 { 1 , 2 , 3 , . . . , 31 } a_1 \in \{1,2,3,...,31\} .

If r = 3 r=3 , then a 1 a_1 must be less than 1000 3 5 = 1000 243 4.1 \frac{1000}{3^5}=\frac{1000}{243} \approx 4.1 , so a 1 a_1 can be any positive integer from 1 1 to 4 4 . We now have 31 + 4 = 35 31+4=35 progressions.

If r = 4 r=4 , then a 1 a_1 must be less than 1000 4 5 = 1000 1024 < 1 \frac{1000}{4^5}=\frac{1000}{1024}<1 , but a 1 a_1 must be a positive integer, so it can't be less than 1 1 , so there exist no progressions for r 4 r \geq 4 because one of the terms would end up being greater than 1000 1000 .

If we let r Q r \in \mathbb{Q} (rational numbers), then we must be careful that all of the terms in the progression are positive integers. If r r is of the form x y \frac{x}{y} , then a 1 a_1 must be of the form k × y 5 , k Z + k \times y^5, k \in \mathbb{Z^+} , so that the y y term in the denominator of r r will cancel for all six terms, leaving an integer. In addition, a 1 × r 5 = k × y 5 × ( x y ) 5 = k × x 5 a_1 \times r^5=k \times y^5 \times (\frac{x}{y})^5=k \times x^5 must still be less than 1000 1000 . For this reason, x x cannot be greater than or equal to 4 4 , so x x can only be 2 2 or 3 3 . And because a 1 a_1 is of the form k × y 5 k \times y^5 , which must also be less than 1000 1000 , y y can only be 1 1 , 2 2 or 3 3 .

The case y = 1 y=1 is the positive integers covered above. For the remaining four possible values of of r = x y { 2 2 , 2 3 , 3 2 , 3 3 } , 2 2 = 3 3 = 1 r=\frac{x}{y} \{\frac{2}{2}, \frac{2}{3}, \frac{3}{2}, \frac{3}{3}\}, \frac{2}{2}=\frac{3}{3}=1 and 2 3 \frac{2}{3} cause a non-increasing sequence, so the only other possible rational value of r r is 3 2 \frac{3}{2} .

a 1 = k × y 5 = k × 2 5 = 32 k a_1 = k \times y^5=k \times 2^5 =32k , must be less than 1000 r 5 = 1000 ( 3 / 2 ) 5 = 32 × 1000 243 \frac{1000}{r^5}=\frac{1000}{(3/2)^5}=\frac{32 \times 1000}{243} , so k k must be less than 32 × 1000 243 32 = 1000 243 4.1 \frac{\frac{32 \times 1000}{243}}{32}=\frac{1000}{243} \approx 4.1 . So k k can be any positive integer from 1 1 to 4 4 . This gives us four progressions defined by r = 3 2 r=\frac{3}{2} and a 1 { 2 5 , 2 × 2 5 , 3 × 2 5 , 4 × 2 5 } a_1 \in \{2^5, 2 \times 2^5, 3 \times 2^5,4 \times 2^5\} . Adding these 4 4 to the 35 35 accounted for before, we get 39 39 progressions.

We have now exhausted all possible values of r r , so we have 39 39 progressions.

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.

Calvin Lin Staff - 7 years ago
Joe Ill
May 20, 2014

For this problem, we can represent the geometric sequence as:

r a 5 ra^{5} , r a 4 b ra^{4}b , r a 3 b 2 ra^{3}b^{2} , r a 2 b 3 ra^{2}b^{3} , r a b 4 rab^{4} , r b 5 rb^{5}

Since 4 5 = 1024 4^{5} = 1024 , we know that b < 4 b < 4 .

We also know that a < b a < b because the sequence is strictly increasing.

For a = 1 a = 1 and b = 2 b =2 , there are 1000 2 5 \frac {1000} {2^5} values of r r ( r r ranges from 1 1 to 31 31 ).

For a = 1 a = 1 and b = 3 b = 3 , there are 1000 3 5 \frac {1000} {3^5} values of r r ( r r ranges from 1 1 to 4 4 ).

For a = 2 a = 2 and b = 3 b = 3 , there are 1000 3 5 \frac {1000} {3^5} values of r r ( r r ranges from 1 1 to 4 4 ).

The sum of all of these is 39 39 .

Laura G
May 20, 2014

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:

  • $r=2, a= 1..31$ (31 cases)
  • $r=3, a= 1..4$ (4 cases)
  • $r=3/2, a= 32, 64, 96, 128$ (4 cases)

In total, 31+4+4=39 possibilities.

T Wj
May 20, 2014

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

" For r=2, since ar^5 = 243a < 1000 \Rightarrow 1 \leq a \leq 31. Similarly for r=3, 1 \leq a \leq 4." Some mix-up here.

Calvin Lin Staff - 7 years ago
Calvin Lin Staff
May 13, 2014

Suppose the first term of the progression is a a and the ratio is r r . Then a a is a positive integer and r r is a rational number with r > 1 r>1 . (Note that r r does not have to be an integer.)

Suppose r = n m , r=\frac{n}{m}, where n n and m m have no common factors. The last term of the progression, a r 5 = a n 5 m 5 ar^5=\frac{an^5}{m^5} must be an integer. So m 5 m^5 divides a , a, thus a m 5 . a\geq m^5. Therefore, a r 5 m 5 n 5 m 5 = n 5 . ar^5\geq \frac{m^5n^5}{m^5}=n^5. Because a r 5 < 1000 , ar^5<1000, this implies n 5 < 1000. n^5<1000. Note that 4 5 = 1024 , 4^5=1024, so n n can only be 2 2 or 3 3 .

If n = 2 , n=2, then m = 1 m=1 (because r > 1 r>1 ). In this case the progression consists of numbers a , 2 a , . . . , 32 a . a,2a,...,32a. This works if and only if 1 a 1\leq a and 32 a < 1000 32a<1000 , which is equivalent to 1 a 31. 1\leq a \leq 31.

If n = 3 , n=3, then m = 1 m=1 or m = 2. m=2. If m = 1 , m=1, then the progression consists of numbers a , 3 a , . . . , 243 a . a,3a,...,243a. This works if and only if 1 a 1\leq a and 243 a < 1000 243a<1000 , which is equivalent to 1 a 4. 1\leq a \leq 4.

If m = 2 , m=2, then, from the argument above, 2 5 2^5 must divide a a , so a = 32 b a=32b for some integer b b . In this case, the progression consists of the numbers 32 b , 48 b , 72 b , 108 b , 162 b , 243 b 32b, 48b, 72b, 108b, 162b, 243b . This works if and only if 1 b 1\leq b and 243 b < 1000 243b<1000 , which is equivalent to 1 b 4. 1\leq b \leq 4.

Putting this all together, we have 31 + 4 + 4 = 39 31+4+4=39 geometric progressions.

Karan Theron
May 20, 2014

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

"a, 3a/2, 9a/4, 27a/8, 81a/16, 243a/81" meant 64 instead of 81?

The argument for bounding the denominator in the case of rational r is wrong.

Calvin Lin Staff - 7 years ago
Matthew Nelson
May 20, 2014

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?

Math-e-Matrix (Nikhil) - 8 months, 3 weeks ago
Riccardo Bertollo
May 20, 2014

We have to find how many couples of integers ( a ; q ) (a;q) are there such as a × q 5 1000 a \times q^5 \leq 1000 In fact, f = e × q = d × q 2 = c × q 3 = b × q 4 = a × q 5 f = e \times q = d \times q^2 = c \times q^3 = b \times q^4 = a \times q^5 , and f must be less or equal to 1000. We see that must be q 5 1000 a q^5 \leq \frac {1000}{a} , so q can be 2 or 3 for 1 a 4 1 \leq a \leq 4 , and can be only 2 for 5 < a 31 5 < a \leq 31 . If a > 31 a > 31 then q = 1 q = 1 , but it can't be, because the progression must be strictly increasing. So, the number of couples ( a ; q ) (a;q) is 4 × 2 + 31 = 39 4 \times 2 + 31 = 39

Right answer for wrong reason: missed fractional ratio, but double-counted some integer ratio cases

Calvin Lin Staff - 7 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...