Answer:
The answers are as follows: 12 106 42
Step-by-step explanation:
Given: 
Using BODMAS rule (Bracket, Of, Division, Multiplication, Addition and Subtraction) we would calculate 
separately and 
separately and add them. So we have 
.
Now for the second question: 
. we would get 
Next, 
. This could be written as: 
. Hence the answers.
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
No.
A chord is a straight segment that joins two points of the circumference. It starts at a point in the circumference and ends at other point in the circumference.
The radius goes from the center of the circle (which is not on the circumference) to one point of the circumference.
The diameter is a chord (the largest chord possible); but not the radius.
Answer:
m = 10/3
<em>(as a decimal: m = 3.333...)</em>
<em />
Step-by-step explanation:
5m - 8 = 2m + 2
5m - 8 = 2m + 2
- 2m - 2m <em>(make all "m" on one side to isolate variable)</em>
3m - 8 = 2
+ 8 + 8 <em>(get m entirely on 1 side)</em>
3m = 10
÷3 ÷3 <em>(divide by 3 to get 1m)</em>
m = 10/3
<em>(as a decimal: m = 3.333...)</em>
<em />
<em />
hope this helps!! have a lovely day :)
Dy/dx = (4y²)(x⁴/³)
Find ∫(4y²)(x⁴/³) =∫(4y²∛(x⁴)dx = 3∛(x⁴).y² +c or 3x⁴/³.y² + c
