Answer:
your answer is "17.6666666667"
Step-by-step explanation:
<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
To express a decimal number (with a finite decimal expression) in a fraction, you work like this: the numerator is the number without decimale separator (you simply pretend it's not there), while the denominator will be
, where n is the number of digits after the decimal separator.
So, in your case, the number without decimal separator is 53, and you have two digits after the decimal separator, so the fraction will be
which is irreducible.
Well, we know that the two consecutive numbers have to be negative, because if it was positive, the smaller number multiplied by two would be much greater. (unless 1 and 2). So, by guessing and checking, we will get -13 and -14 :)