How to solve this problem by finding x

Mathematics

2 answers:

Firdavs [7]3 years ago

8 0

Ticket for a pantomime cost $80 for children. A party of 25 pays $143 in total. how many adults were there in the party?
can anyone answer this?
can anyone answer this

LekaFEV [45]3 years ago

5 0

Answer:

X=140

Step-by-step explanation:

Firstly, any Quadrilateral has a total sum of its angle equal to 360 degrees

The attachment you are showing us shows that we already know two angles

(70)&(60) degrees. I am assuming the line DC is a tangent, so angle ADC must be 90 degrees since a full angle on a tangent is equal to 180 degrees and there is 90 from the other side (180-90=90). Now we know 3 angles and what you have to do is find X so that when you add them all up they make a sum of 360.

X+70+60+90=360

X=360-70-60-90

X=140

You might be interested in

Cora uses a ratio of 18 cherries to 3 peaches when she makes a pie filling. Lena uses an equivalent ratio to Cora. If Lena uses

Lelechka [254]

Lena would have to use 54 cherries

3 0

2 years ago

victor needs 300 feet of rope.The rope he wants to buy is sold by yards.He knows that there are 3 feet in 1 yard.How many yards

barxatty [35]

We need to convert 300 feet to yards.

We know,

3 feet = 1 yard

Hence,

300 feet * 1 yard/3 feet = 300/3 = 100 yards

He should buy 100 yards

5 0

1 year ago

How many times will 1/4 go into 2 2/4

Scilla [17]

Well, there are 4 of 1/4 in each whole number. there is two whole numbers, so that makes 8 of 1/4's. Now we add the two in the fraction and we come out with 10. 1/4 can go into 2 2/4 10 times.

7 0

3 years ago

Read 2 more answers

Pigeon Hole Principle :

yaroslaw [1]

Answer:

A proof can be as follows:

Step-by-step explanation:

Let $S=\{a_{1},a_{2},...,a_{n},a_{n+1}\}$ be a set of $n+1$ integers. By the division algorithm the possible remainders when we divide by $n$ are $0,1,2,....,n-1$ . Then, each integer $a_{i}\in S$ can be written as:

$a_{i}=np_{i}+r_{i},\,\,0\leq r_{i}$

Observe that the set of remainders $\{r_{1},r_{2},...,r_{n+1}\}$ has $n+1$ elements and each element has $n$ possible values. By the Pigenhole principle at least two remainders have the same value. Suppose that this two elements are $a_{i}, a_{j}$ . Then,