[REBOL] OT: Competition - Is this solvable
From: robert::muench::robertmuench::de at: 24-Nov-2007 12:59
Hi all, yesterday I had a situation where I had to hunt a difference
between some numbers and I thought if this problem can be solved in
general. Here is the situation:
You have one sum: 41695,83
And a set of numbers: 6594,14 + 981,75 + 8747,39 + 1457,90 + 15114,65
The sum you have doesn't match the sum of the single numbers.
Now the question is: What (minimal) typos in the set of numbers leads to
the sum you have?
I find this an interesting question. If it's possible to derive a set of
possible typos these sets could be ranked by some propability. And than it
would be possible to check differences in data sets back to typos.
I hope it's clear what I mean. So, has anyone any idea if this is
solvable? Robert
