M_VSR = Help meeeeeeeee
1 answer:
You might be interested in
Answer:
Because each term of the sequence generates numbers with more than 1 and itself as dividers
Step-by-step explanation:
Just for the sake of correction.
1) Let's consider that
n! =n(n-1)(n-2)(n-3)...
2)And examine some numbers of that sequence above:
Every Natural number plugged in n, and added by two will a be an even number not only divisible by two, but in some cases by other numbers for example,n=4, then 4!+2=26 which has four dividers.
3) Similarly, the same happens to
and
Where we can find many dividers.
There's an example of a sequence, let's start with a prime number greater than 1
Let n=11
That's a long sequence of consecutive composite numbers, n=11.
Answer:
Adter ate of the remaining pie.
Step-by-step explanation:
equation:
⇒
when subtracting fractions, make sure both denominators are the same, to do this, multiply the first fraction by 3 and the second fraction by 2
⇒
⇒
solve:
⇒
⇒
simplify:
⇒ =