1. Engineering
  2. Computer Science
  3. it should be n 2k m...

Question: it should be n 2k m...

Question details

Use the well-ordering principle to prove that given any integer n z 1, there exists an odd integer m and a nonnegative integer k such that n 2k m.

It should be n = 2k * m

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution