Consider the following two strings of digits: $11001010100101011$ and $110100011000100$. First consider them to be in base $10$ and sum them to get $n$. Then consider them to be in binary, sum them, write the answer in binary, then interpret the digits of the sum as if they were in base $10$ to get $m$. What is $n-m$?

Guest Dec 22, 2020