hectoc is a puzzle, where one is given a sequence of six decimal digits and the task is to intersperse arithmetic operations from the given set $+,-,/,*$ and matching brackets $(,)$ in a way that the resulting valid arithmetic expression yields $100$.
The example on the homepage illustrates the task: $123456\mapsto 1+(2+3+4)*(5+6)=100$
Questions:
have hectoc-type diophantine equations already been recognized by the professional mathematics community and if yes,
- what is their formal generalized definition; (apparently one needs at least a finite sequence of digits, a set of symbols denoting operations or precedence and a set of rules for valid expressions)?
- which theoretical results are available regarding proving/disproving existence of solutions and methods for finding solutions?
which possible applications for hectoc-type equations can be envisaged?