benchmarks.wiki / Public workspace

MATH / 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,…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Consider the following two strings of digits: 1100101010010101111001010100101011 and 110100011000100110100011000100. First consider them to be in base 1010 and sum them to get nn. 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 1010 to get mm. What is n−mn-m?
Plain-text mathematical notation (without MathML)
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?
Original LaTeX notation
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$?

level

Level 5

type

Number Theory

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import