Answer:
31465 ways
Step-by-step explanation:
Given data
Let us apply the combination formula
nCr = n! / r! * (n - r)!
n= 31
r= 4
substitute
= 31!/4!(31-4)!
= 31!/4!(27)!
= 31*30*29*28*27!/ 4!(27)!
= 31*30*29*28/4!
=31*30*29*28/4*3*2*1
=755160/24
=31465 ways
Hence there are 31465 possible ways to rank it
Never. If they are not on the same plane, then they cannot intersect because 2 lines and 1 point are always on a plane, in this case the original line, then a point in the middle to the point that creates the other line would be included, hence if they are non-coplaner then they cannot intersect.
Answer:-25
Step-by-step explanation:
simplify
Answer:
32
Step-by-step explanation:
Given:
- The slant length 10 units
- A right square pyramid with base edges of length 8
Now we use Pythagoras to get the slant height in the middle of each triangle:
= = units
One again, you can use Pythagoras again to get the perpendicular height of the entire pyramid.
= = 6 units.
Because slant edges of length 10 units each is cut by a plane that is parallel to its base and 3 units above its base. So we have the other dementions of the small right square pyramid:
- The height 3 units
- A right square pyramid with base edges of length 4
So the volume of it is:
V = 1/3 *3* 4
= 32
9 - 6 + 4 - 8/3 ..,
geometric series a(n) = a1r^(n-1)
r = a(n+1)/a(n)
-6/9 = -2/3
4/-6 = -2/3
-8/3/4 = -2/3
so r = -2/3 and a1 = 9
Sn = a1(1-r^n)/(1-r) = 9(1-(-2/3)^n)/(1-(-2/3))
n is infinite Sn = 9/(5/3) = 27/5