Answer:
x<-3
Step-by-step explanation:
-7x+6/3 >9
-7x+6 >27
-7x>27-6
-7x>21
-x>3
x<-3
Answer
Step-by-step explanation:
3g+57
Answer:
f(9) = f(8)·(-3)
Step-by-step explanation:
A recursive function is one where each successive term is calculated using the previous term;
The clear pattern demonstrated in the sequence of terms shown is that each term is multiplied by -3 to give the next one;
Hence, the correct option is the first.
<h2>
Answer with explanation:</h2>
The number of letters in word "ALGORITHM" = 9
The number of combinations to select r things from n things is given by :-

Now, the number of combinations to select 6 letters from 9 letters will be :-

Thus , the number of ways can six of the letters of the word ALGORITHM=84
The number of ways to arrange n things in a row :
So, the number of ways can the letters of the word ALGORITHM be arranged in a be seated together in the row :-

If GOR comes together, then we consider it as one letter, then the total number of letters will be = 1+6=7
Number of ways to arrange 9 letters if "GOR" comes together :-

Thus, the number of ways to arrange 9 letters if "GOR" comes together=5040