Find the number of unique permutations of the letters in the word: ONGOING

Step-by-step explanation:

  This particular permutation  deals with words that have repeated letters.

Given word = "ONGOING"

the formula for the permutation is

where   n   is the amount of letters in the word, and  m A , m B , ... , m Z  are the occurrences of repeated letters in the word. Each   m  equals the amount of times the letter appears in the word.

So in the word  "ONGOING"

n= 7

mO= 2

mN= 2

mG=2

55/i dont know i do it for the points

step-by-step explanation:

(x3 + 6x2 + 2x - 6) • (x - 1)

step-by-step explanation:

polynomial long division :

3.2     polynomial long division

dividing :   x4+5x3-4x2-8x+6

                              ("dividend")

by         :     x-1     ("divisor")

dividend     x4   +   5x3   -   4x2   -   8x   +   6

- divisor   * x3     x4   -   x3            

remainder         6x3   -   4x2   -   8x   +   6

- divisor   * 6x2         6x3   -   6x2        

remainder             2x2   -   8x   +   6

- divisor   * 2x1             2x2   -   2x    

remainder               -   6x   +   6

- divisor   * -6x0               -   6x   +   6

remainder                     0

quotient :   x3+6x2+2x-6   remainder:   0