Integers a , b , c , d and e satisfy 5 0 < a < b < c < d < e < 5 0 0 , and a , b , c , d , e form a geometric sequence. What is the sum of all possible distinct values of a ?
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.
This is a pretty well written solution. There is slight issue here: the last case should be n ≥ 4 , not n = 4 . The most common inaccuracy was failing to rigorously justify that n 4 must divide a .
Exactly Same Way.
Since, it is a geometric sequence, there is a common ratio between the consecutive terms of the sequence. Lets assume the common ratio is r .
Firstly, we will prove that 1 < r < 2 .
Since, a < b , it is apparent that r = a b > 1 .
r < 2 because, if r ≥ 2 , then, the minimum possible value of the fifth term of the sequence a r 4 = 5 0 × 2 5 = 8 0 0 > 5 0 0 which contradicts with the given conditions.
So, 1 < r < 2 .
It is also apparent that r is rational number, because, a , b , c , d , e ϵ N and the product of a irrational number and a natural number is always irrational.
So, we can write that r = y x where x , y ϵ N and they are co-prime and x > y .
Now, for a , b , c , d and e to be integers, a has to be divisible by y 4 . Otherwise, a r 4 = a y 4 x 4 would not be an integer.
Since,
a
is divisible by
y
4
, we can see that the minimum value of
y
4
a
=
1
and therefore the minimum value of
a
r
4
=
a
×
y
4
x
4
=
x
4
.
And since, the value of
e
=
a
r
4
cannot exceed
5
0
0
, therefore
x
4
<
5
0
0
and so
x
<
4
5
0
0
≈
4
.
7
.So, the maximum possible value of
x
=
4
.
We can also see that the minimum value of
x
=
3
. Cause, we said earlier that
x
>
y
and
x
,
y
are positive integers.If
x
≤
2
, then the only possible values of
x
are
2
and
1
. [Since,
x
is a positive integer.]
But, we said that
x
>
y
. But, there is no positive integer less than 1. And since
y
has to be a positive integer, so there is no possible value of
y
when
x
=
1
.Similarly, when
x
=
2
,
y
=
1
.But, then,
r
=
2
. But, we have proved that
1
<
r
<
2
So,
x
>
2
. So, the minimum value of
x
is
3
.
So, we can say that 3 ≤ x ≤ 4 .
So, the only possible values of x are 4 and 3 .
Now, when
x
=
4
,
3
is the only possible value for
y
.
[ Since,
y
>
1
and
y
<
x
and
x
and
y
are co-prime.]
So,
r
=
3
4
.
So, the minimum value of
a
=
3
4
. This is the only value of
a
. Because, since
a
is divisible by
3
4
, we can write
a
=
k
×
3
4
where
k
ϵ
N
.
Then
a
r
4
=
k
×
4
4
<
5
0
0
or,
k
<
4
4
5
0
0
or,
k
<
1
6
4
6
1
Since,
k
is a natural number, the only possible value of
k
is 1.
In the same way, When
x
=
3
, the only value of
y
is
2
.
So, the only value of
r
is
2
3
.
Since,
a
is divisible by
2
4
, we can write that
a
=
k
×
2
4
where
k
ϵ
N
.
So,
e
=
a
r
4
=
2
4
×
k
×
2
4
3
4
=
k
×
3
4
So,
k
×
3
4
<
5
0
0
or,
k
<
3
4
5
0
0
or,
k
<
6
8
1
1
4
So, the maximum value of
k
is
6
.
On the other hand,
k
×
2
4
>
5
0
or,
k
>
3
8
1
So, the minimum value of
k
is
4
.
So, the sum of all the possible values of
a
in this case is
k
=
4
∑
6
(
k
×
2
4
)
.
So, the sum of all the possible values of
a
=
3
4
+
k
=
4
∑
6
(
k
×
2
4
)
=
1
5
×
2
4
+
3
4
=
3
2
1
.
So, the answer is
3
2
1
.
Suppose the common ratio is a positive integer, say x ,where x = 1 , or that x ≥ 2 . Then e = a ∗ x 4 > a ∗ 2 4 = 1 6 a > 8 0 0 > e , a contradiction.
So the common ratio x is not an integer. However it is surely a rational number, because x = a b . Let x = q p in its reduced form, where q = 1 and p > q , since the G.P. is increasing.
So e = q 4 a ∗ p 4 , so that q 4 must be a factor of a . Suppose q ≥ 4 , then clearly,
q p ≥ q q + 1 ≥ ( 1 + q 1 ) ≥ 4 5 . Also a ≥ q 4 ≥ 2 5 6
Thus e ≥ 2 5 6 ∗ ( 4 5 ) 4 ≥ 6 2 5 , a contradiction.
Thus q = 2 , 3 . If q = 2 , then p = 3 is the only possibility, otherwise q p will be 2 or more. So x = 2 3 , and 1 6 is a factor of a . Clearly e = 1 6 8 1 a < 5 0 0 , or a < 9 9 , and thus a = 6 4 , 8 0 , 9 6 .
If q = 3 , then a ≥ 8 1 and p = 4 , 5 . But for p = 5 , e = a ∗ x 4 ≥ 3 4 8 1 ∗ 5 4 = 6 2 5 ≥ e , a contradiction. So p = 4 . Now e = 8 1 2 5 6 a < 5 0 0 , or a < 1 5 9 . But since 8 1 is a factor of a , a = 8 1 .
Thus the sum of all possible values of a are 6 4 + 8 0 + 9 6 + 8 1 = 3 2 1 .
Given: geometric series of integers increasing between 50 and 500. Terms (a,b,c,d,e) could be written as (a, a r, a r^2, a r^3, a r^4) with r being the ratio between terms in the geometric series.
r must be greater than 1 for it to be an increasing geometric series. r^4 must be less than 10 for it to be between 50 and 500 (which have a ratio of 10)
Roughly, this means that r^2 < 3 and r < 1.75. In summary, 1 < r < 1.75
In order for a,b,c,d,e to all be integers, the ratio must be a rational number. Let us call this ratio x/y a must be evenly divisible by y^4 or not all a,b,c,d,e will be integers
Now, we must remember that a * (x/y)^4 must be less than 500. If x is 5 or greater, we will be multiplying by 625 in the numerator. a/(y^4) will be one or greater or else not all of a,b,c,d,e will be integers. This means that x must be smaller than 5.
If x=2, then the only possible ratio greater than 1 is 2/1, which does not satisfy r^4 < 10.
Thus, x=3 or x=4.
If x=3, y=2 (if y=1, r^4 is not less than 10). Thus, a must be a power of 16 (so that a is evenly divisible by y^4), and it must be greater than 50. a = 64, 80, 96 all satisfy this with a*r^4 < 500
If x=4, y=3 (if y=2, r^4 is not less than 10). Thus, a must be a power of 81 (so that a is evenly divisible by y^4). a = 81 satisfies a*r^4 < 500
64+80+96+81 = 321
We have that e = a r 4 , where r is the common ratio. Since 2 4 ⋅ 5 0 = 8 0 0 > 5 0 0 , r < 2 . Also, a must be divisible by a fourth power, since r is not an integer. a can only be divisible by 1 6 , 8 1 , 2 5 6 , since all other fourth powers are too big. Similarly, the numerator of r can only be 2 , 3 , 4 . This gives two values of r : 2 3 and 3 4 .
If r = 2 3 , 1 6 ∣ a . If a ≥ 1 1 2 , e ≥ 5 6 7 , so a = 6 4 , 8 0 , 9 6 .
If r = 3 4 , 8 1 ∣ a . If a ≥ 1 6 2 , e ≥ 5 1 2 , so a = 8 1 .
The answer is 6 4 + 8 0 + 9 6 + 8 1 = 3 2 1 .
Nice one, I've noticed it so helpful!
Let the terms be a , a r , a r 2 , a r 3 & a r 4 . [where r is the common ratio with r > 1 ]
So, a > 5 0 and a r 4 < 5 0 0 ⇒ r < 2
So, r is a rational of form q p with 1 < q < p < 2 q . [ p , q integers]
So, last term e = a r 4 = q 4 a p 4
⇒ a = k q 4 > 5 0 [all terms are integers], so 2 ≤ q ≤ 3 [ q ≤ 3 as q < p < 5 as stated below]
Also, e = k p 4 < 5 0 0 with k ≥ 1 . So 3 ≤ p ≤ 4
With q = 2 , p = 3 , we have 3 < k < 7 giving 3 solutions with corresponding a's : 4 ∗ 2 4 , 5 ∗ 2 4 , 6 ∗ 2 4 .
With q = 3 , p = 4 , we have 0 < k < 2 giving 1 solution with corresponding a: 3 4 .
So required sum is 3 2 1 .
Rewrite the form of the sequence terms in terms of a and r , the common ratio of the geometric sequence. Thus 5 0 < a < a r < a r 2 < a r 3 < a r 4 < 5 0 0 . Clearly, for all of the terms to remain integers, a must have as a factor the fourth power of some integer, say f .
f can either be 2, 3, or 4 since 2 4 = 1 6 , 3 4 = 8 1 and 4 4 = 2 5 6 ; note that f = 5 will cause a = 6 2 5 > 5 0 0 . The common ratio r is then a fraction f f + 1 - it is sufficient to consider this as we are only concerned with which values of a satisfy the condition and we don't want a r 4 to exceed 500.
For f = 2 , it becomes apparent that the valid solutions of a are 4 × 2 4 , 5 × 2 4 and 6 × 2 4 , as larger constant factors will cause a r 4 > 5 0 0 . For f = 3 , a = 3 4 is the only possible solution as larger constant factors will also cause a r 4 > 5 0 0 . Finally for f = 4 , we cannot get any solutions for a as we will always have a r 4 > 5 0 0 .
Thus our solutions for a are 6 4 , 8 0 , 9 6 and 8 1 . Adding these up gives the desired answer 3 2 1 .
First, 1 < r < 2 since the sequence is increasing and 2 4 = 1 6 > 1 0 . Thus, r must be a fractional number. This requires that a have at least four of some prime factor.
Say a has four (or more) factors of 2. The smallest such that a > 5 0 is 1 6 ∗ 4 . The lowest r with 2 in the denominator is 2 3 , and 6 4 ∗ ( 2 3 ) 4 is 4 ∗ 3 4 = 3 2 4 . Thus, 6 4 works, as well as 8 0 and 9 6 , but not 1 1 2 .
Repeating with 3 , we find that only 8 1 works.
We can confirm that 4 and all further factors do not work for a since, at minimum, e = a r 4 → e = x 4 ( x x + 1 ) 4 → e = ( x + 1 ) 4 , and ( x + 1 ) 4 > 5 0 0 for all x ≥ 4 .
6 4 + 8 0 + 9 6 + 8 1 = 3 2 1 .
As a,b,c,d,e are integers and 1<r<2
Only for r= 3/2 and 4/3 we get all integer values for a b c d e.
a= 64+80+96+81= 321
Let a = k , b = k r , c = k r 2 , d = k r 3 and e = k r 4 where r is the common ratio.
r can't be 1 , since a < b < c < d < e .
Also r can't be 2 , since e < 5 0 0 .
Hence 1 < r < 2 . Since a , b , c , d and e are integers, the possible common ratio's are : r = 3 4 and 2 3 . For r = 3 4 a = 8 1 and for r = 2 3 , a = 6 4 or 8 0 or 9 6 .
Answer = 8 1 + 6 4 + 8 0 + 9 6 = 3 2 1 .
e = a * r^4
also e/a upper limit is 10 so r^4 < 10 implies r < 2
if r= 3/2, e/a = 81/16 min value of a = 64 ... for which e = 324 ... under the allowable limit also, a = 80 ... for which e = 405 ... is under the allowable limit if a = 96 ... for which e = 486 But if a = 112 ... e>500
if r= 4/3 ... e/a = 256/81 min value of a = 81 ... for which e = 256 there is no other multiple of 81 which keeps e<500
if r = 5/3 ... e/a = 625/81 ... that itself takes e>500 ... so we cannot have 5 or any other larger number in the numerator of 'r'
thus the only possible values of 'a' are: 64, 80, 96, 81 ... sum 321
Problem Loading...
Note Loading...
Set Loading...
Because all of the terms in the geometric sequence are integers, the common ratio must be rational. Thus, we can write the sequence as a , a ( n m ) , a ( n m ) 2 , a ( n m ) 3 , a ( n m ) 4 , where m , n are relatively prime, and m > n (because the sequence must be strictly increasing). Now, the most important property of a is that n 4 must divide it. Noting that n = 1 does not lend itself to any possible values for a , we begin our casework with n = 2 .
If n = 2 , then 1 6 ∣ a , and a > 5 0 . Thus, the smallest possible value for a is 6 4 . We need only to confirm that there exists an integer m such that m > n and that 2 4 6 4 ⋅ m 4 = 4 m 4 < 5 0 0 . Indeed, m = 3 works. and so a = 6 4 is a solution. We continue this process for n = 2 , finding a = 8 0 , 9 6 are also possible starting values. However, if a > = 1 1 2 , we find that m must be an integer less than 3 , and so there are no more solutions for this case.
Continuing with n = 3 in a similar fashion, we find a = 8 1 to be the smallest multiple of 8 1 greater than 5 0 . Easily, m = 4 is the only value of m that satisfies all conditions. Again, note that for a > = 1 6 2 , m must be an integer less than 4 , which does not satisfy m > n , and so there are no more solutions.
Considering n = 4 , it follows that the smallest possible value for m is 5 ; however, this yields that e = 6 2 5 ⋅ n 4 a (with n 4 a being an integer), which clearly is greater than 5 0 0 . Thus, there are no more solutions.
From this casework, the solutions are a = 6 4 , 8 0 , 9 6 , 8 1 , which sum to 3 2 1 .