SOLUTION: Will n! +2, n! +3,..., n! +n for n>=2 always be a sequence of n-1 composite numbers? Why?

Question 265387: Will n! +2, n! +3,..., n! +n for n>=2 always be a sequence of n-1 composite numbers? Why?
Answer by jim_thompson5910(35256) (Show Source): You can put this solution on YOUR website!
Take note that 2 is a factor of n! if n>=2. Why? Let's say that n=5, then n!=5!=5*4*3*2*1.

For any other value of n>=2, 2 will always be a factor of n!

Likewise, 3 is a factor of n! if n>=3. Notice that if n=2, then you only have one term. Similarly, 4 is a factor of n!+4 for n>=4 (if n<4 then you have at most two terms). This idea generalizes to the fact that n is a factor of n!. This is trivial since n!=n(n-1)...(2)(1) for any value of n.

Because of the facts stated above, we can factor out the GCFs to get the new sequence:

2((n-1)!+1), 3((n-1)!+1), 4((n-1)!+1), ... n((n-1)!+1),

Since each term in the sequence is a product of two factors (other than 1 or itself), this means that each term is a composite number for any value of n.
RELATED QUESTIONS
prove that: Sum of n numbers in a sequence is... (answered by stanbon,TP)

Which of the following expressions must be positive for all values of n? n^2 + n... (answered by josgarithmetic)

a(n) stands for sequence a(1)=2, a(2)=3, {{{a(n+2)=a(n+1)+1/ln(a(n))}}} Prove that the (answered by CPhill)

solve for n: n=... (answered by jim_thompson5910)

solve for n: n=... (answered by jim_thompson5910,josmiceli)

n!(n+2)=n!+(n+1)! (answered by LinnW)

Dear math teacher, I am having difficulties with the following problem: 4 times nC2 (answered by Theo)

List all elements of the set A ∩ B, where A = {n ∈ N | n = 2^n − 1} and (answered by richard1234)

Which of the following pairs of expressions could represent consecutive odd numbers? n... (answered by 55305,jim_thompson5910)