jorfos7683
jorfos7683
20.06.2020 • 
Mathematics

Prove m and h are unique, that is prove n = 2m1 · h1 = 2m2 · h2 ⇒ (m1 = m2) ∧ (h1 = h2) (b) Define a function f : Z + → (Z + ∪ {0}) × ODD, f(n) = (m, h), if n = 2mh, and prove that f is a bijection. ( Note that a) shows f is well defined). (c) Define a bijection g : Z + × Z + → (Z + ∪ {0}) × ODD , that is define a function g and prove it is a bijection. (d) Explain why the steps above prove that Z +

Solved
Show answers

Ask an AI advisor a question