1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Jlenok [28]
3 years ago
14

Which of the following properties is always true for a parallelogram and why ?

Mathematics
2 answers:
posledela3 years ago
5 0
A. Diagonals bisect each other is always true. Each diagonal<span> cuts the </span>other<span> into two equal parts. It is because of the parallel lines in the parallelogram. </span>
Artemon [7]3 years ago
4 0
The answer is A. Because the parallel lines of the parallelogram,also the diagonal bisect each other always.
You might be interested in
the table shows the number of boarders on Saturday 12 and Sunday 8. the numbers decreased from Saturday to sunday. What is the p
Vladimir [108]

Answer:

Step-by-step explanation:

= (12-8)/12 × 100%

= 4/12 × 100%

= 100/3%

= 33.33%

5 0
3 years ago
What is 0.75×2 please show your work need a answer today
attashe74 [19]
1.50 that should be it and i dont know how to show my work on a computer SORRY.
8 0
3 years ago
Read 2 more answers
During a snowstorm, snow accumulated at a constant rate of 8/3 centimeters per hour. if the snow continued to fall at that rate
ikadub [295]

Answer:

16 centimeters

Step-by-step explanation:

The constant rate is 8/3 (cm/hr)

8/3 = 2.67 (rounded to hundredths place)

Multiply the dividend by the time, which is 6 hours

2.67 x 6 = 16.02

Therefore, 16.02 (or 16 depending on how you rounded) centimeters accumulated on the ground.

3 0
3 years ago
Read 2 more answers
Will is packing cubes with side lengths that are
fgiga [73]

Answer:

54

Step-by-step explanation:4545

5 0
3 years ago
Read 2 more answers
Suppose n people, n ≥ 3, play "odd person out" to decide who will buy the next round of refreshments. The n people each flip a f
blondinia [14]

Answer:

Assume that all the coins involved here are fair coins.

a) Probability of finding the "odd" person in one round: \displaystyle n \cdot \left(\frac{1}{2}\right)^{n - 1}.

b) Probability of finding the "odd" person in the kth round: \displaystyle n \cdot \left(\frac{1}{2}\right)^{n - 1} \cdot \left( 1 - n \cdot \left(\frac{1}{2}\right)^{n - 1}\right)^{k - 1}.

c) Expected number of rounds: \displaystyle \frac{2^{n - 1}}{n}.

Step-by-step explanation:

<h3>a)</h3>

To decide the "odd" person, either of the following must happen:

  • There are (n - 1) heads and 1 tail, or
  • There are 1 head and (n - 1) tails.

Assume that the coins here all are all fair. In other words, each has a 50\,\% chance of landing on the head and a

The binomial distribution can model the outcome of n coin-tosses. The chance of getting x heads out of

  • The chance of getting (n - 1) heads (and consequently, 1 tail) would be \displaystyle {n \choose n - 1}\cdot \left(\frac{1}{2}\right)^{n - 1} \cdot \left(\frac{1}{2}\right)^{n - (n - 1)} = n\cdot \left(\frac{1}{2}\right)^n.
  • The chance of getting 1 heads (and consequently, (n - 1) tails) would be \displaystyle {n \choose 1}\cdot \left(\frac{1}{2}\right)^{1} \cdot \left(\frac{1}{2}\right)^{n - 1} = n\cdot \left(\frac{1}{2}\right)^n.

These two events are mutually-exclusive. \displaystyle n\cdot \left(\frac{1}{2}\right)^n + n\cdot \left(\frac{1}{2}\right)^n  = 2\,n \cdot \left(\frac{1}{2}\right)^n = n \cdot \left(\frac{1}{2}\right)^{n - 1} would be the chance that either of them will occur. That's the same as the chance of determining the "odd" person in one round.

<h3>b)</h3>

Since the coins here are all fair, the chance of determining the "odd" person would be \displaystyle n \cdot \left(\frac{1}{2}\right)^{n - 1} in all rounds.

When the chance p of getting a success in each round is the same, the geometric distribution would give the probability of getting the first success (that is, to find the "odd" person) in the kth round: (1 - p)^{k - 1} \cdot p. That's the same as the probability of getting one success after (k - 1) unsuccessful attempts.

In this case, \displaystyle p = n \cdot \left(\frac{1}{2}\right)^{n - 1}. Therefore, the probability of succeeding on round k round would be

\displaystyle \underbrace{\left(1 - n \cdot \left(\frac{1}{2}\right)^{n - 1}\right)^{k - 1}}_{(1 - p)^{k - 1}} \cdot \underbrace{n \cdot \left(\frac{1}{2}\right)^{n - 1}}_{p}.

<h3>c)</h3>

Let p is the chance of success on each round in a geometric distribution. The expected value of that distribution would be \displaystyle \frac{1}{p}.

In this case, since \displaystyle p = n \cdot \left(\frac{1}{2}\right)^{n - 1}, the expected value would be \displaystyle \frac{1}{p} = \frac{1}{\displaystyle n \cdot \left(\frac{1}{2}\right)^{n - 1}}= \frac{2^{n - 1}}{n}.

7 0
3 years ago
Other questions:
  • Write the least 9-digit number possible without repeating a digit. what is the value of the digit 2?
    5·1 answer
  • Evaluate the following using the distributive property 6(3+9)
    9·2 answers
  • A person filing his federal income tax return with the Single filing status had a
    14·2 answers
  • How many different collections can be composed out of 5 red balls 3 white balls and 1 black ball?
    12·1 answer
  • Consider the differential equation: (y^2+2*x)dx+(2*x*y-1)dy = 0. (a) show that the equation is exact by evaluating (\partial m)/
    8·1 answer
  • Evaluate the dot product of (3,-1) and (1,5).<br><br> Answer here
    6·1 answer
  • If the cost of electricity increases by 30% by what percentage one should reduce his spend in order that spends on electricity s
    5·1 answer
  • Is the following statement true or false?<br> Every line segment has a length.
    6·1 answer
  • Identify the first five terms of the sequence in which a1 = 3 and an = 4an−1− 5 for n ≥ 2.
    14·2 answers
  • Scientists are sending a rover to the moon. Their plan is to study a rectangular area of the moon by placing a grid over the map
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!