Answer:
The number of different possible poker hands is found by counting the number of ways that 5 cards can be selected from 52 cards, where the order is not important. It is a combination, so we use c n r
Step-by-step explanation:
The possible number of the poker hands is probably . C 52 5= 52!/5!x47!= 2598960
Answer:
hey im sry for ditching on u so many times jgilpin i was just so busy w school and sh. it and i couldnt talk then, but i an talk now and in sry if i pis. sed u off :(
Step-by-step explanation:
Answer:
j = (h-4) / k
Step-by-step explanation:
Unless there is more information given about this question somewhere else in the assignment, I'm assuming you are being asked to solve this equation for j.
If so, then its just a matter of rearranging the equation so that it is in the form
j = (expression containing other variables)
(h-4) / j = k (multiply both sides by j)
(h-4) = jk (divide both sides by k)
j = (h-4) / k
Answer:
y=3x
Step-by-step explanation:
y=kx, where k is constant
3y, 1x...so 3y = 1x
check: looking at the graph at 4.5y, 1.5x where y and x intersect...
4.5=3(1.5)
3 x 1.5 = 4.5
Answer:
=
+
+
Step-by-step explanation:
=multiple ways to climb a tower
When n = 1,
tower= 1 cm
= 1
When n = 2,
tower =2 cm
= 2
When n = 3,
tower = 3 cm
it can be build if we use three 1 cm blocks
= 3
When n = 4,
tower= 4 cm
it can be build if we use four 1 cm blocks
= 6
When n > 5
tower height > 4 cm
so we can use 1 cm, 2 cm and 4 cm blocks
so in that case if our last move is 1 cm block then will be
n —1 cm
if our last move is 2 cm block then will be
n —2 cm
if our last move is 4 cm block then will be
n —4 cm
=+ +
