Answer:
87.92
Step-by-step explanation:
you have your radius 14 inches to get the answer is
1: pie is 3.14
2: circumference is 2× 3.14×14
3: 3.14×14
4: 43.96 × 2
The highest possible number of inhabitants in that little town are 743.
<h3>What are inhabitant?</h3>
A person or animal that lives in a place is called as the inhabitant.
Suppose there is this little town with a finite number of people: (1) No two inhabitants have exactly the same number of hairs. (2) No inhabitant has exactly 743 hairs or no hairs at all. (3) There are more inhabitants than there are hairs on the head of any inhabitant.
Let say there are 519 people in the town. and make them stand in a line with increasing number of hairs on their heads. This way, there will be a person on the last, who has no hair.
There are more number of people than the hairs. From bald to 742 hairs, 743 is the limit.
Thus, the highest possible number of inhabitants in that little town are 743.
Learn more about inhabitant.
brainly.com/question/15121341
#SPJ1
Answer:
Step-by-step explanation:
Solution by substitution method
3x-4y=8
and 18x-5y=10
Suppose,
3x-4y=8→(1)
and 18x-5y=10→(2)
Taking equation (1), we have
3x-4y=8
⇒3x=4y+8
⇒x=(
4y+8)/
3 →(3)
Putting x=
(4y+8
)/3 in equation (2), we get
18x-5y=10
18(
(4y+8)
/3) -5y=10
⇒24y+48-5y=10
⇒19y+48=10
⇒19y=10-48
⇒19y= -38
⇒y=-
38
/19
⇒y= -2→(4)
Now, Putting y=-2 in equation (3), we get
x=4y+8
x=
(4(-2)+8)
/3
⇒x=
(-8+8)/
3
⇒x=
0/
3
⇒x=0
∴x=0 and y= -2
Answer:
The probability is 
Step-by-step explanation:
We can divide the amount of favourable cases by the total amount of cases.
The total amount of cases is the total amount of ways to put 8 rooks on a chessboard. Since a chessboard has 64 squares, this number is the combinatorial number of 64 with 8, 
For a favourable case, you need one rook on each column, and for each column the correspondent rook should be in a diferent row than the rest of the rooks. A favourable case can be represented by a bijective function 
with A = {1,2,3,4,5,6,7,8}. f(i) = j represents that the rook located in the column i is located in the row j.
Thus, the total of favourable cases is equal to the total amount of bijective functions between a set of 8 elements. This amount is 8!, because we have 8 possibilities for the first column, 7 for the second one, 6 on the third one, and so on.
We can conclude that the probability for 8 rooks not being able to capture themselves is
Answer:
(0, 6)
Step-by-step explanation:
The point (0, 6) is on the y-axis, so after a reflection over the y-axis, it is still (0, 6).
