# Thread: Proving step to full proof

1. ## Proving step to full proof

I was doing a proof to prove that there exists arbitrarily long strings of composite numbers.
In more technical language, for every $\displaystyle m\in {N}$, there exists a n such that
$\displaystyle n, n+1, n+2, n+3,..., n+m$ is composite

to do so, I let $\displaystyle n=m!$,(for m>3) then we get the sequence:
$\displaystyle m!, m!+1, m!+2, m!+3,..., m!+m$

Every element of this sequence is obviously divisible by some integer, except $\displaystyle m!+1.$

Now I must prove that m!+1 is always an composite. I have no idea how to do this. I tried induction and contradiction.

2. Originally Posted by I-Think
I was doing a proof to prove that there exists arbitrarily long strings of composite numbers.
In more technical language, for every $\displaystyle m\element{N}$, there exists a n such that
$\displaystyle n, n+1, n+2, n+3,..., n+m$ is prime

to do so, I let $\displaystyle n=m!$,(for m>3) then we get the sequence:
$\displaystyle m!, m!+1, m!+2, m!+3,..., m!+m$

Every element of this sequence is obviously divisible by some integer, except $\displaystyle m!+1.$

Now I must prove that m!+1 is always an integer. I have no idea how to do this. I tried induction and contradiction.
There are so many typos in this I think you should correct them before expecting a reply.

Also this is number theory.

To show that for any $\displaystyle n\in \mathbb{N}$ there is a set of $\displaystyle n$ consecutive composites choose $\displaystyle $$m so that \displaystyle m=n+1. Then \displaystyle m!+2, m!+3,.. m!+m are all composite, and there are \displaystyle m-1=n of these. CB 3. Originally Posted by I-Think Now I must prove that m!+1 is always an composite. I have no idea how to do this. I tried induction and contradiction. Help please You can't since if \displaystyle$$ m=2$ then $\displaystyle m!+1=5$ is prime

CB

4. I apologize for the typos. I also apologize for posting this in the wrong forum but I did not expect the problem to involve Number Theory, as it is a topic I had not yet covered.

And as for proving that $\displaystyle m!+1$is always composite, I had stated it was over the range $\displaystyle m>3$

5. Let n = (m+2)! + 2

P.S: m! + 1 is composite when m = p-1 for some prime p > 3.

6. Originally Posted by i-think
i apologize for the typos. I also apologize for posting this in the wrong forum but i did not expect the problem to involve number theory, as it is a topic i had not yet covered.

And as for proving that $\displaystyle m!+1$is always composite, i had stated it was over the range $\displaystyle m>3$
ok 11!+1

cb

7. Infact following should work

n = (m+1)! + 2