# Math Help - proof by contradiction

Hi,

I have to prove the following by contradiction

the set S = [all natural numbers n such that n is a multiple of 13] has no greatest element

I have started by saying let greatest value = x, where x is a member of S and x is greater than or equal to n

then let n=13k for some natural number k

x is greater than or equal to 13k

not sure where to go from here??

thanks

2. ## Re: proof by contradiction

Originally Posted by AU11
I have to prove the following by contradiction
the set S = [all natural numbers n such that n is a multiple of 13] has no greatest element
We know that $(\forall k\in\mathbb{N})[k

If $n=\max(S)$ is it true $n=13k~\&~n=13k<13(k+1)=n+13~?$

3. ## Re: proof by contradiction

Hi,

I don't get why you have written k=13k?

plus do I not talk about x (the greatest element) anymore?

4. ## Re: proof by contradiction

Originally Posted by AU11
Hi,

I don't get why you have written k=13k?

plus do I not talk about x (the greatest element) anymore?
See my edit.

If $x$ is a real number $x+1$ is a real number and $x so there cannot a greatest real number.

If $0 then $0<\frac{x}{2} so there can be no smallest positive number.

5. ## Re: proof by contradiction

ohh right, I understand it now!

thanks for the help