Hidden Inversions (Robbers' Thread)

This is a puzzle, the cops' thread can be found here.

Your task will be to find an anagram of the provided programs in the cops' thread that performs its left inverse.

Once you crack an answer post the solution as an answer below and notify the original answerer.

You will be scored on the number of programs you are the first to crack.

Python 3, 46 bytes, Lynn

lambda x0223334566789:(x0223334566789*89)//178
• How do I "notify the original answerer"? – G B Jan 16 '17 at 15:24
• Left a comment linking your answer on the original – Sefa Jan 16 '17 at 15:25
• You should drop the f= at the start of your code since its not needed and not part of the original function – 0 ' Jan 16 '17 at 15:26
• Done, I just copy-pasted it too quickly. – G B Jan 16 '17 at 15:26
• Here I am actually brute forcing a solution (and even assuming one exists) and you just sidestep the entire problem! +1 – orlp Jan 16 '17 at 15:26

Python 2, 225 bytes, orlp

p=90930641353124136621573325641513715557077985927835294018496194596645372722158;q=101979812089012306249375934082966806799688507587087308196267706260111970225882#--223444799
lambda n:pow(n,pow(65537,(p*q-2*(p+q))/4,p*q),~p*~q)

Guess I got lucky after guessing random prime divisors all day...

Crack

[:(](07-5)"3 #.-:&#$,)5#.inv] Try it online! Another crack equivalent is [:((3 ]7-5)#.-:&#$,)5#.inv"0]

Explanation

[:(](07-5)"3 #.-:&#$,)5#.inv] Input: integer n ] Get n 5 The constant 5 #.inv Get the digits of n in base 5 [:( ) Operate on those digits D , Flatten D (does nothing since it is already a list) # Get the length of D -:& Halve it$             Reshape D to half its length (only the base 2 digits)
(07-5)"3                     The constant 2 with rank 3
#.                  Convert the front-half of D to a decimal from base 2
]                             Return the right result
• Yep, that works! It's a bit different from my solution, but there's a lot of leeway. The basic logic is the same though. – Zgarb Jan 23 '17 at 14:55