The following is a solver for the puzzle posted at http://www.facebook.com/jobs_puzzles/?puzzle_id=5.
There are two inputs and the result is calculated by taking every number between these two inputs, inclusively, converting them to a binary string and counting how many of these binary strings have a prime number of 1 bits.
