Loading [MathJax]/jax/output/HTML-CSS/jax.js


SpecialSequence Exeter
2015


Problem - 2056
Define a sequence of positive integers s1,s2,...,s10 to be terrible if the following conditions are satisfied for any pair of positive integers i and j satisfying 1i<j10: - si>sj - ji+1 divides the quantity si+si+1++sj Determine the minimum possible value of s1+s2++s10 over all terrible sequences.

report an error