Doesn't seem possibleNumber Theory Level 4
Let \(N\) be the smallest positive integer for which the digit sum of \(N\) and the digit sum of \(N+1\) are both divisible by \(50\). How many digits of \(N\) are 9?
Details and assumptions
The digit sum of a number is the sum of all its digits. For example the digit sum of 1123 is \(1 + 1 + 2 + 3 = 7\).