- #1

- 51

- 0

## Homework Statement

a)Prove, by induction on n, that for all n ∈ N(natural numbers), Distance(x,y)<or equal to 0

b)Prove, by induction on n, that for all n ∈ N(natural numbers), Distance(x,y)<or equal to n

## Homework Equations

proof by induction:

Base case P(1)

then assume p(k) is true

then prove p(k+1) is also true by induction.

## The Attempt at a Solution

Alright so I have been practicing induction problems in my discrete mathematics class,

however I am not quite sure where to start.

I just need some guidance to starting the problem. (the algorithm throws me off, im new to coding)

I do understand the concept of induction.

Specifically...

In part a, What exactly is the statement that I am proving by induction?

p(n)= n >(or equal to) 0 is this correct?