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

Targeted 10

Mathematics
1 answer:
Nataly [62]3 years ago
5 0

Answer:

not enough info

Step-by-step explanation:

You might be interested in
What is the area of the rectangle below?
Trava [24]
The area of a rectangle is length times width
6 0
3 years ago
10x-2y=18 8x=y solve by substitution
lana [24]

Answer:

x = -1 and y = 18

Step-by-step explanation:

Given the system of equations

y + 8x = 10... 1

2y - 4x = 40 ... 2

From 1; y = 10-8x

Substitute into 2;

2(10-8x) - 4x = 40

20 - 16x - 4x = 40

20 - 20x = 40

-20x = 40 - 20

-20x = 20

x = -1

Recall that y = 10-8x

y = 10 - 8(-1)

y = 10 + 8

y = 18

therefore your answer is  x = -1 and y = 18

4 0
3 years ago
Read 2 more answers
I will give brainliest!!!
Licemer1 [7]

The equation would be worded as: 2m+16=36.

Solve! Using the subtraction property of equality, 2m=20. Then the division property of equality lets us figure out that m=10.

Hope that helped! Happy SOLVING!


5 0
4 years ago
Read 2 more answers
Convert (-3, 0) to polar form.
labwork [276]

Answer:

The answer would be A. (3,0)

3 0
3 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
Other questions:
  • 12.68 is greater than 12.8 because 68 is better than correct
    5·2 answers
  • Least common denominator for 4/11 and 3/8
    7·1 answer
  • Plz helppp..........!!!!!!!!!!!
    6·1 answer
  • Andrea has been asked to move several boxes of packing peanuts from the main office to the store room. She will have to carry ea
    10·1 answer
  • PLEASE HELP ME<br> I WILL GIVE YOU BRAINLIEST
    14·1 answer
  • 3023.33/1214.124 <br> i need to know what this is please
    12·2 answers
  • Solve. Your solution needs to have the variable first. -4 + x &lt; -10
    11·1 answer
  • What is 3(4x−8) in simplified form?<br><br> 7x−11<br><br> 12x−8<br><br> 12x + 24<br><br> 12x−24
    8·2 answers
  • What is the probability of a red on this spinner?<br> Be sure to reduce.
    14·2 answers
  • Need this worked out please so I can understand it
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!