Convenient Combinatorics
Source:
September 7, 2024
combinatorics2024
Problem Statement
Call a positive integer convenient if its digits can be partitioned into two collections of contiguous digits whose element sums are and . For example, is convenient, but is not. Compute the number of convenient positive integers less than or equal to .