- #1

mustang19

- 75

- 4

*Mentor note: moved to the homework section*

Claim: all numbers divisible by 4 are divisible by 2.

Premise: let p(n) return 4n, I.e., the function covers all numbers divisible by four.

Reasoning:

Let n equal 1 in the base case

P(n) is divisible by 2

P(n+1) is divisible by 2

By induction all n are divisible by 2

QED

Last edited by a moderator: