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
Dominik [7]
3 years ago
10

Help me pls this is hard

Mathematics
1 answer:
ohaa [14]3 years ago
5 0

Answer:

Opposite angles are right angles.

Step-by-step explanation:

There are no right angles in a parallelogram.

You might be interested in
The sum of the interior angles of a quadrilateral equals. 180 270 360 540
lys-0071 [83]
The sum of the interior angles in any given quadrilateral is always going to be 360.

This means each angle inside the quadrilateral added up with always equal 360 degrees.

Hope this helps!
Brainliest is always appreciated if you feel its deserved! :)<span />
7 0
3 years ago
Read 2 more answers
A city is approximately circular with a radius of 10.6 miles. Approximately 90,000 people live there. What is the population den
Harman [31]

Answer:

513 people per square mile

Step-by-step explanation:

because

6 0
3 years ago
Can someone give me the answer please
xz_007 [3.2K]

Answer:

I think have many options

8 0
2 years ago
Give a combinatorial proof that if n is a positive integer, then
gregori [183]

The Empire is attacking a Rebel base that is stocked with n X-wings and n Y-wings. The Rebels need to build a fleet consisting of n ships (with at least 1 X-wing), to be led by 1 pilot in an X-wing.

There are \binom n1=n ways of picking the leader, and \binom{2n-1}{n-1} ways of building the rest of the fleet, so there's a total of

n\dbinom{2n-1}{n-1}

ways of building such a fleet.

In the other direction, suppose we build a fleet comprising of k X-wings and n-k Y-wings. We have \binom nk ways of picking X-wings and \binom n{n-k} ways of picking Y-wings. Also from the k X-wings we pick 1 to be the leader, which we can do in \binom k1=k ways. So there are

k\dbinom nk\dbinom n{n-k}

ways of building such a fleet. But since

\dbinom nk=\dbinom n{n-k}, we have

k\dbinom nk^2

ways of building the fleet with these specifications. Sum over all possible values of k,

\displaystyle\sum_{k=1}^nk\binom nk^2

4 0
4 years ago
Look at the 2 pictures to solve
bija089 [108]

Answer:

x = 15.3

x = 20.9

Step-by-step explanation:

sin(46) = 11/x

⇒ x = 11/sin(46) = 15.3

cos(55) = 12/x

⇒ x = 12/cos(55) = 20.9

3 0
2 years ago
Other questions:
  • We play a game where there are 50 coins in a row, we take turns taking between 1 and 5 coins however many you like. whoever take
    11·1 answer
  • Please help me.
    7·1 answer
  • If f(x)=4x-6 and g(x)=√x+2, what is (f°g)(7)
    6·1 answer
  • 10-2+2^2+5 what is the answer
    6·1 answer
  • Plz answer the question in the ss
    6·1 answer
  • 2h = W-3p<br> (solve for p)
    14·1 answer
  • Gyuhun takes out a loan of $1500 to
    14·1 answer
  • Draw an ordered stem and leaf diagram to show this information​
    10·1 answer
  • Use the recursive formula f(n) = 0.4 . f(n-1) + 12 to determine the 2nd term if f(1) = 4.
    5·2 answers
  • What’s is 3%of 19.86
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!