4 ms·
I know it is solvable because I've done it. Disclaimer: I did not create it. The source of the ad is one of my customers, although they gave me no hints to sol
by NateLawson 17y ago
I know it is solvable because I've done it.
Disclaimer: I did not create it. The source of the ad is one of my customers, although they gave me no hints to solve it.
- tptacek 17y agoYou pretty much gave away the answer with the title of the posting, for what it's worth.
- NateLawson 17y agoThe most important hint is to realize it is encrypted, not a math equation.
- ahlatimer 17y agoThat, along with finding out who Binet is (if you weren't already aware), makes it pretty trivial to solve.
- nabin 17y agoOk so l = map(ord,message) for i in l: a = f(l) And now hat? a is a big integer, chr(a mod 256)? nothing.. :-/
- ahlatimer 17y agoI posted the solution on my blog. If anyone wants to figure it out themselves, then don't read it. http://ahlatimer.wordpress.com/2010/01/12/bart-solution/ http://ahlatimer.wordpress.com/2010/01/12/bart-solution/