Prove by induction

**mathwizard** · June 17th 2008, 10:56 PM

1. Prove by induction:
(a) $1 \le n\ \forall n \in N;$
(b) $\forall n \in N,$ either $n = 1$ or $n-1 \in N$ ; and
(c) $\forall n \in N,$ there is no element $m$ of $N$ in the range $n < m < n+1.$

2. Prove by induction on $n$ that $\forall m, n \in N\ \exists q \in N$ such that $qm > n.$
Also prove that for every $n \in N$ , there is an $m \in N$ such that $2^m > n$ .

**ThePerfectHacker** · June 18th 2008, 06:44 AM

Originally Posted by mathwizard

1. Prove by induction:
(a) $1 \le n\ \forall n \in N;$
(b) $\forall n \in N,$ either $n = 1$ or $n-1 \in N$ ; and
(c) $\forall n \in N,$ there is no element $m$ of $N$ in the range $n < m < n+1.$

2. Prove by induction on $n$ that $\forall m, n \in N\ \exists q \in N$ such that $qm > n.$
Also prove that for every $n \in N$ , there is an $m \in N$ such that $2^m > n$ .

You can prove some of these without induction, if that is okay with you.
Like Problem 1(c), you can do it by definition of what it means being a natural number.

**mathwizard** · June 18th 2008, 09:26 AM

Originally Posted by ThePerfectHacker

You can prove some of these without induction, if that is okay with you.
Like Problem 1(c), you can do it by definition of what it means being a natural number.

No. The question specifies to prove the statements by induction. I think the proof relies on the four axioms that a field $F$ must satisfy. This is from my advanced calculus textbook (first chapter & first section, btw).

Thread: Prove by induction

LinkBack

Thread Tools

Display

Prove by induction

Similar Math Help Forum Discussions

prove by induction

Rigorously prove the principle of complete induction from mathematical induction??

Prove by induction

PROVE BY INDUCTION

Prove by Induction

Search Tags