Answer:
f) a[n] = -(-2)^n +2^n
g) a[n] = (1/2)((-2)^-n +2^-n)
Step-by-step explanation:
Both of these problems are solved in the same way. The characteristic equation comes from ...
a[n] -k²·a[n-2] = 0
Using a[n] = r^n, we have ...
r^n -k²r^(n-2) = 0
r^(n-2)(r² -k²) = 0
r² -k² = 0
r = ±k
a[n] = p·(-k)^n +q·k^n . . . . . . for some constants p and q
We find p and q from the initial conditions.
__
f) k² = 4, so k = 2.
a[0] = 0 = p + q
a[1] = 4 = -2p +2q
Dividing the second equation by 2 and adding the first, we have ...
2 = 2q
q = 1
p = -1
The solution is a[n] = -(-2)^n +2^n.
__
g) k² = 1/4, so k = 1/2.
a[0] = 1 = p + q
a[1] = 0 = -p/2 +q/2
Multiplying the first equation by 1/2 and adding the second, we get ...
1/2 = q
p = 1 -q = 1/2
Using k = 2^-1, we can write the solution as follows.
The solution is a[n] = (1/2)((-2)^-n +2^-n).
Answer:
a) 4,096
b) 0.000244
Step-by-step explanation:
a)
By the Fundamental rule of counting, there are
4*4*4*4*4*4 = 4,096
ways of forming six-digit arrangements where each position has 4 possibilities (1 to 4)
b)
The probability of entering the correct code on the first try, assuming that the owner does not remember the code is
1/4096 = 0.000244
I am pretty sure your answer is going to be 243
I hope this helps, and good luck!!
Answer:
X is 50
Step-by-step explanation:
Answer:
5
Step-by-step explanation:
