{"resolved":true,"match_type":"uuid","source_type":"original_book","book_id":"38270854-596f-4a26-8183-db8c968c6020","title":"编码 隐匿在计算机软硬件背后的语言","author":null,"edition":null,"publisher":null,"year":null,"isbn":"9787121181184","requested_by":"printed_page","book":{"source_type":"original_book","book_id":"38270854-596f-4a26-8183-db8c968c6020","id":"38270854-596f-4a26-8183-db8c968c6020","uuid":"38270854-596f-4a26-8183-db8c968c6020","title":"编码 隐匿在计算机软硬件背后的语言","normalized_title":"编码隐匿在计算机软硬件背后的语言","author":null,"edition":null,"publisher":null,"year":null,"isbn":"9787121181184","isbns":["9787121181184","0123456789","6044921875","3039331000","0000000000","0000000000000"],"parsed":true,"ai_readable":true,"document_type":"book","page_count":438,"navigation_url":"https://workshop.closeclaw.top/ai/book/38270854-596f-4a26-8183-db8c968c6020","title_url":"https://workshop.closeclaw.top/ai/title/%E7%BC%96%E7%A0%81%20%E9%9A%90%E5%8C%BF%E5%9C%A8%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%BD%AF%E7%A1%AC%E4%BB%B6%E8%83%8C%E5%90%8E%E7%9A%84%E8%AF%AD%E8%A8%80","fixed_page_url_template":"https://workshop.closeclaw.top/ai/book/38270854-596f-4a26-8183-db8c968c6020/page/{printed_page}","path_api_url_template":"https://workshop.closeclaw.top/api/ai/book/38270854-596f-4a26-8183-db8c968c6020/page/{printed_page}","read_url":"https://workshop.closeclaw.top/api/ai/read/38270854-596f-4a26-8183-db8c968c6020","page_url":"https://workshop.closeclaw.top/api/ai/books/38270854-596f-4a26-8183-db8c968c6020/page","search_url":"https://workshop.closeclaw.top/api/ai/books/38270854-596f-4a26-8183-db8c968c6020/search"},"page":{"printed_page":149,"pdf_page":165,"physical_index":165,"physical_index_base":0,"printed_page_status":"recognized","page_sha256":"fa0363b5b82aba85752611dc35d4cfb171b9111089fc2b2472953a9a5d37be2e"},"chapter":"编码隐匿在计算机软硬件背后的语言","content":"$$\n\\frac { 2 5 3 } { 1 0 2 3 }\n$$\n\n最后再将结果加1，并减去1000。\n\n$$\n\\begin{array} { r } { 1 0 7 6 } \\\\ { + 1 } \\\\ { \\frac { - 1 0 0 0 } { 7 7 } } \\end{array}\n$$\n\n到此，我们就得到了结果。答案与先前的相同，而且没有用到借位。\n\n为什么这种方法行得通呢？原题目是这样的：\n\n$$\n2 5 3 - 1 7 6\n$$\n\n在这个式子中加上一个数再减去这个数，结果是相同的。因此先加上1000，再减去1000:\n\n$$\n2 5 3 - 1 7 6 + 1 0 0 0 - 1 0 0 0\n$$\n\n这个式子与下式等价：\n\n$$\n2 5 3 - 1 7 6 + 9 9 9 + 1 - 1 0 0 0\n$$\n\n然后用以下方式将数字重新组合：\n\n$$\n2 5 3 + ( 9 9 9 - 1 7 6 ) + 1 - 1 0 0 0\n$$\n\n这个式子与刚才描述过的用9的补数进行的计算是相同的。我们用两个减法和两个加法来替代一个减法，而在这个过程中避免了烦琐的借位。\n\n如果减数大于被减数会怎么样呢？例如以下问题：\n\n$$\n\\frac { - 2 5 3 } { 3 7 3 }\n$$\n\n通常遇到这个问题时你可能会说：“这里减数大于被减数，因此要将减数和被减数交换来执行减法，然后给结果取个相反数。”你可能在脑子里将这两个数交换，而写出这样\n\n13 如何实现减法\n\n149","previous_page":148,"next_page":150}