Generalise to any instance of the parity problem (checking if a binary string has an even or odd number of 1s), without resorting to chain-of-thought/scratchpad/least-to-most type of prompting.
Generalise to any instance of the parity problem (checking if a binary string has an even or odd number of 1s), without resorting to chain-of-thought/scratchpad/least-to-most type of prompting.