Answer: P(26,5).
That is all the possible combinations of 5 letters made out from 26 letters.
That is 26! / [ 5! ( 26 - 5)! ] = 26! / [5! 21! ] = 26*25*24*23*22*21! / [ 5! 21!] =
= 26*25*24*23*22 / [5*4*3*2*1] = 65,780 arrangements.
Answer:
1) 36
b) 5
c) 3.0
Step-by-step explanation:
1) The recursive formula that defines the given sequence is

That means we keep adding 4 to the subsequent terms:
The sequence will be:
12,16,20,24,28,32,36,...
Therefore the seventh term is 36.
2) The sequence is recursively defined by;

This means, we have to keep subtracting 5 from the subsequent terms.
The sequence will be;
20,15,10,5,...
Therefore the fourth term is 5
3) The sequence is recursively defined by:
f(n+1)=f(n)+0.5
where f(1)=-1.5
This means that, the subsequent terms can be found by adding 0.5 to the previous terms.
The sequence will be:
-1.5,-1.0,-0.5,0,0.5,1,1.5,2.0,2.5,3.0,....
Therefore f(10)=3.0
Answer:
y = -4x + 10
Step-by-step explanation:
I am going to assume you are trying to write the equation of a line.
4x + y = 10
4x - 4x + y = 10 - 4x
y = -4x + 10
Answer:
B)x=23
y=20
Step-by-step explanation: