JOMO 7, Short 8
There are two sequences of integers { a i } i = 1 4 and { b i } i = 1 4
If you do as what is shown, if you cancel the ∑ sign, like ∑ j = 1 4 b j ∑ j = 1 4 a j = b i a i ∀ i ∈ { 1 , 2 , 3 , 4 } then it will be a Big Mistake !!! .
But for how many ordered pairs of sequences (< a i > , < b i >) such that 1 ≤ a 1 < a 2 < a 3 < a 4 ≤ 2 0 1 ≤ b 1 < b 2 < b 3 < b 4 ≤ 2 0 is the above said "False" property seen to be "True" ?
∙ This problem is a part of the set Mistakes Give Rise To Problems , and this question appeared in JOMO 's Contest #7 , and was posed by me.
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 that in your blue equation, you should not reuse the variable i . You should take your summation over j .
I'm confused. Why can't we have a i = 1 and b i = 7 , which gives the fraction of 7 1 ?
Log in to reply
Sir this is right ! I wanted to say there STRICT inequality, which means they all can NOT be equal, the problem is valid ! Please remove that reported thing, you can't have the fraction anything else than what i have stated in the question, please edit it to 1 ≤ a 1 < a 2 < a 3 < a 3 < a 4 ≤ 2 0 , and same for b i
If there is strict inequality then the question will be correct.
@Calvin Lin ,Edited, fixed the flaw. And I used the variable i itself in blue term because I wanted to state from it that b 1 a 1 = b 2 a 2 = b 3 a 3 = b 4 a 4 ....I think this is best way to state it indirectly.
When i included it in our JOMO 7 contest , it was written correct, the condition needs to be 1 ≤ a 1 < a 2 < a 3 < a 4 ≤ 2 0 , and then you can't have fraction as 7 1
Problem Loading...
Note Loading...
Set Loading...
By the converse of theorem on equal ratios, we conclude that b i a i = k ∀ i ∈ ( 1 , 2 , 3 , 4 )
Hence we want to find sequences of length 4 of < a i > and < b i such that b 1 a 1 = b 2 a 2 = b 3 a 3 = b 4 a 4 and are integers in the range [1,20].
We know that only numbers which have at least 4 multiples in the range [1,20] are 1 , 2 , 3 , 4 and 5 .
Hence we will have 1 9 different fractions possible (fractions are the values of k possible), namely 1 , 2 1 , 3 1 , 4 1 , 5 1 , 3 2 , 5 2 , 4 3 , 5 3 , 5 4 and their reciprocals. (only 1 won't give a different reciprocal and 2/4 is same as 1/2).
Thus the equal ratios b i a i can have 19 distinct values ( k )
We'll find the number of sequences with the greater of the two numbers in the fraction because the smaller number will adjust it's multiples to keep the value same.
And that will always be ( 4 q ) where q is defined as number of multiples less than 21, of the number maximum out of x and y where x and y are numbers included in the fraction.
Here, 5 will be the maximum number in 8 fractions, namely 5 1 , 5 2 , 5 3 , 5 4 and their reciprocals .
Thus, the number sequences for this will be 8 × ( 4 4 )
4 will be the maximum number in 4 fractions, namely 4 1 , 4 3 and their reciprocals.
Thus 4 × ( 4 5 ) sequences pairs.
3 will be the maximum number in 4 fractions, namely 3 1 , 3 2 and their reciprocals.
Thus 4 × ( 4 6 ) pairs of sequences.
2 will be maximum number in 2 fractions, which are 2 1 and 1 2
Thus 2 × ( 4 1 0 ) pairs of sequences.
1 will be maximum in only 1 1 ,which gives ( 4 2 0 ) pairs of sequences.
Hence there will be total of ( 4 2 0 ) + 2 × ( 4 1 0 ) + 4 × ( 4 6 ) + 4 × ( 4 5 ) + 8 × ( 4 4 ) = 5 3 5 3