Difference between revisions of "2017 JBMO Problems/Problem 1"
| Line 17: | Line 17: | ||
So, we only have to consider integers from <math>1</math> up to <math>12</math>. Therefore we calculate the following products: | So, we only have to consider integers from <math>1</math> up to <math>12</math>. Therefore we calculate the following products: | ||
| − | A = { | + | A = { 2⋅1, 4⋅5, 8⋅7, 13⋅14, 10⋅11} |
| − | B = { | + | B = { 1⋅4, 2⋅5, 3⋅6, 4⋅7 5⋅8, 6⋅9, 7⋅10, 8⋅11, 9⋅12} |
| − | C = { | + | C = { 2⋅7, 5⋅10, 10⋅15} |
| − | |||
| − | |||
Either 3⋅6 or 6⋅9 or 9⋅12 needs to be included in every solution set. | Either 3⋅6 or 6⋅9 or 9⋅12 needs to be included in every solution set. | ||
| Line 30: | Line 28: | ||
Case 1: <math>x_1-x_2 = x_3 -x_4 = x_5 -x_6 = 3</math> | Case 1: <math>x_1-x_2 = x_3 -x_4 = x_5 -x_6 = 3</math> | ||
| + | |||
| + | We just have to look at set B in this case. | ||
<math> 2 \cdot 5 + 3 \cdot 6 = 4 \cdot 7</math> | <math> 2 \cdot 5 + 3 \cdot 6 = 4 \cdot 7</math> | ||
| Line 53: | Line 53: | ||
Case 5: <math>x_1-x_2 = 3, x_3 -x_4 = 5, x_5 -x_6 = 1</math> | Case 5: <math>x_1-x_2 = 3, x_3 -x_4 = 5, x_5 -x_6 = 1</math> | ||
| − | No solution set for this case. | + | No solution set for this case since no element of set C can be a solution. |
== See also == | == See also == | ||
Revision as of 09:56, 21 April 2018
Problem
Determine all the sets of six consecutive positive integers such that the product of some two of them, added to the product of some other two of them is equal to the product of the remaining two numbers.
Solution
Every set which a solution is of the form 
Since they are consecutive, it follows that 
are even and 
are odd.
In addition, exactly two of the six are multiples of 
and need to be multiplied together. Exactly one of these two is even (and also the only one which multiple of 
) and the other is odd.
In addition, each pair of positive integers destined to be multiplied together can have a difference of either 
or or 
.
So, we only have to consider integers from up to 
. Therefore we calculate the following products:
A = { 2⋅1, 4⋅5, 8⋅7, 13⋅14, 10⋅11}
B = { 1⋅4, 2⋅5, 3⋅6, 4⋅7 5⋅8, 6⋅9, 7⋅10, 8⋅11, 9⋅12}
C = { 2⋅7, 5⋅10, 10⋅15}
Either 3⋅6 or 6⋅9 or 9⋅12 needs to be included in every solution set.
And we can only have five cases:
Case 1: 
We just have to look at set B in this case.
Y_2 is the only solution set for this case.
Case 2: 
Y_1 and Y_6 are the only solution sets for this case.
Case 3: 
No solution set for this case, as the multiples of three need to be multiplied together.
Case 4: 
No solution set for this case, as the multiples of three need to be multiplied together.
Case 5: 
No solution set for this case since no element of set C can be a solution.
See also
| 2017 JBMO (Problems • Resources) | ||
| Preceded by First Problem |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 | ||
| All JBMO Problems and Solutions | ||
