Prove that there is a prime between n and n factorial

Let k = n! - 1. Well, since all numbers from 2 to n divide n!, none of these divides k. This means that k either a prime , in which case we are done, or there exists a prime p > n which divides n! - 1. In the latter case, p is between n and n factorial and p is prime, so the proof is complete.

the answer would be 1 1/72

step-by-step explanation:

you can rewrite the equation by separating the parts and then solving individually:

10-9=1

1/8 - 1/9=

find l c d and then combine:

1 1/72

a) 7x=7

step-by-step explanation: