## [REBOL] Re: OT: Competition - Is this solvable

### From: ale870:gm:ail at: 24-Nov-2007 16:02

I didn't tried, but I think you could use the same algorithm used to convert
a decimal valu into binary.
Basically, you have a number to be converted (example 122).
These are the minimal needed steps:
binary number weight are (8 bits): 128 64 32 16 8 4 2 1
(Your numbers are (from upper to lowest): 15114,65 // 8747,39 // 6594,14 //
1457,90 // 981,75
Apply the standard conversion algorithm to get the bit to be set to "1".
Maybe you can do the same with your problem...
On Nov 24, 2007 12:59 PM, Robert M. Münch <robert.muench-robertmuench.de>
wrote:

> 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
> --
> To unsubscribe from the list, just send an email to
> lists at rebol.com with unsubscribe as the subject.
>

--
//Alessandro
http://sguish.wordpress.com
http://laccio.wordpress.com