相关文档

《Mathematics for Computer》Problem Set 4 Solutions

Problem Set 4 Solutions Due: Monday, February 28 at 9 PM Problem 1. Prove all of the following statements except for the two that are false; for those, provide counterexamples. Assumen 1. When proving each statement, you may assume all its predecessors (a)a =(mod n) Solution. Every number divides zero, so n (a-a), which means a a (mod n). (b)a≡b(modn) impliesa(modn)
团购合买资源类别:文库,文档格式:PDF,文档页数:4,文件大小:153.17KB
点击进入文档下载页(PDF格式)
已到末页,全文结束
点击下载(PDF格式)

浏览记录