Formula: f(x) = a(x – h)2 + k
transformation: 1 unit right 2 units up
vertex: (h,k) -> (1,2) it’s positive because it has to be the opposite
maximum/minimum: maximum
range: (-∞, ∞)
domain: y ≥2
Answer:
I’m doing a really big test right now too go to Desmos Scientific Calculator and put the expression its should give it simplified
Step-by-step explanation:
Answer:
Step-by-step explanation:
So let a[i] be the input array to the function find_minimum(): . We will use python to present this recursive algorithm
def find_minimum(a, n):
if n == 1:
return a[0]
return min(a[n], find_minimum(a, n - 1))
find_minimum(a, len(a) - 1)
Answer:
69090840 possible rankings
Step-by-step explanation:
The number of possible ranking ordered in terms of effectiveness can be obtained using permutation
Number of salesperson = 39
Number of rank = 5
nPr = n! ÷ (n - r)!
nPr = 39P5
39P5 = 39! ÷ (39 - 5)!
39P5 = 39! ÷ 34!
39P5 = 39 * 38 * 37 * 36 * 35 = 69090840
The GCF for 16 and 72 is 8, as that is the largest multiple they can both be multiples by.
