\(\text {Proof the following}\)

\(\bullet\) Given any positive integer \(\displaystyle k\) ,prove that there are \(\displaystyle k\) consecutive integers that are all composite.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestOne line proof. \( (k+1)! + i \) where \( 2 \leq i \leq k+1 \)

Log in to reply

Sorry,I didn't get it.Please explain it clearly@Siddhartha Srivastava

Log in to reply

Expanding on what Dinesh Chavan said. \( (k+1)! = (k+1)*k*(k-1)...*4*3*2 \). So for each \( 2 \leq i \leq k+1 \), we see that \( i|(k+1)! \). Also, it is trivially true that \( i|i \). Therefore, \( i| (k+1)! + i \). Since \( i \) divides the number and it is greater than one, the number must be composite.

Log in to reply

If u know factorial notation then notice that for each $i$ that same $i$ from factorial expansion will come out common and the expression will be composite.

Log in to reply