K = n^2 + 9n + 1 Mo says,
“k will be a prime number for all integer values of n from 1 to 9”
Show that Mo is wrong.
You must show that your value of k is not prime.

55/i dont know i do it for the points

step-by-step explanation:

well there are two answers for that.

1: you need 120 ones then that will equal up to 120.

2: you could also do one 100 and 2 tens.

those are the answers that i have thought of.

we have the parent function given by,

1. the function is translated 5 units to the left.

so, we get,   becomes

2. the function is translated 5 units to the right.

so, we get,   becomes

3. the function is translated 5 units upwards.

so, we get,   becomes

4. the function is translated 5 units downwards.

so, we get,   becomes

5. the function is reflected across x-axis.

so, we get,   becomes

6. the function is reflected across y-axis.

so, we get,   becomes .

step-by-step explanation:

mark brainliest.