You want to multiply together the number of possible choices for each digit in the code.
0-9 is ten possible numbers, since repetitions are allowed (example code 2,2,2,2) there are ten possible choices per digit in the code.
10*10*10*10 = 10,000 four digit coded possible
Answer: it’s 6:00 pm
Step-by-step explanation:
A) as the exponent decreases by one, the number is divided by 5
B) as the exponent decreases by one, the number is divided by 4
C) as the exponent decreases by one, the number is divided by 3
D) 4⁰ = 4 ÷ 4 = 1
4⁻¹ = 1 ÷ 4 = 
4⁻² = ÷ 4 = 
E) 3⁰ = 3 ÷ 3 = 1
3⁻¹ = 1 ÷ 3 = 
3⁻² = ÷ 3 = 
Im not sure if im correct but I think the answer is 82 hours.
Answer:
Σ(-1)^kx^k for k = 0 to n
Step-by-step explanation:
The nth Maclaurin polynomials for f to be
Pn(x) = f(0) + f'(0)x + f''(0)x²/2! + f"'(0)x³/3! +. ......
The given function is.
f(x) = 1/(1+x)
Differentiate four times with respect to x
f(x) = 1/(1+x)
f'(x) = -1/(1+x)²
f''(x) = 2/(1+x)³
f'''(x) = -6/(1+x)⁴
f''''(x) = 24/(1+x)^5
To calculate with a coefficient of 1
f(0) = 1
f'(0) = -1
f''(0) = 2
f'''(0) = -6
f''''(0) = 24
Findinf Pn(x) for n = 0 to 4.
Po(x) = 1
P1(x) = 1 - x
P2(x) = 1 - x + x²
P3(x) = 1 - x+ x² - x³
P4(x) = 1 - x+ x² - x³+ x⁴
Hence, the nth Maclaurin polynomials is
1 - x+ x² - x³+ x⁴ +.......+(-1)^nx^n
= Σ(-1)^kx^k for k = 0 to n
