ROSECODE 166
Hendeca divisibility
It can be proved that there is a smallest integer h such as for any sequence of k (greater or equal to h) consecutive integers there is always one whose digital sum is divisible by 11.
It is not true for less than h consecutive integers.
What is h?
What is the first exception, i.e the smallest e such as the (h-1) consecutive integers starting with e have their digital sum not divisible by 11?
Answer format: h,e
It is not true for less than h consecutive integers.
What is h?
What is the first exception, i.e the smallest e such as the (h-1) consecutive integers starting with e have their digital sum not divisible by 11?
Answer format: h,e