Someone please help me I suck @ simplifying thank you

Mathematics

2 answers:

dsp733 years ago

5 0

To solve this question, you would need to find the common denominator among the 2 fractions. In this case it would be

72.

Then multiply numbers to both of the fractions to get to the bottom number in both fractions equaling 72.

40/72 + 27/72 =67/72.

Try to reduce to lowest terms by dividing a common number from both of them if possible.

kogti [31]3 years ago

3 0

It is just .55 and .375 so .55+ .375

You might be interested in

Solve the system by either elimination or substitution

Alex_Xolod [135]

The correct answer is A: x=2 and y=-3. Either method would work, but for example, let's use elimination. If you multiply the second equation by 5, you get: 10x +5y = 5. When you add both equations, you can then cross out both y terms. You are left with one equation that reads: 13x=26. Solving for x gives you 2. You can substitute 2 in for x in either equation and you will receive -3 for your y value.

5 0

3 years ago

What is the slope of a line with the equation y=5x+2/5

igomit [66]

The slope-intercept form: y = mx + b

m - a slope

y = 5x + 2/5

Answer: The slope m = 5.

4 0

3 years ago

Prove the following DeMorgan's laws: if LaTeX: XX, LaTeX: AA and LaTeX: BB are sets and LaTeX: \{A_i: i\in I\} {Ai:i∈I} is a fam

MariettaO [177]

$X-(A\cup B)=(X-A)\cap(X-B)$

I'll assume the usual definition of set difference, $X-A=\{x\in X,x\not\in A\}$ .

Let $x\in X-(A\cup B)$ . Then $x\in X$ and $x\not\in(A\cup B)$ . If $x\not\in(A\cup B)$ , then $x\not\in A$ and $x\not\in B$ . This means $x\in X,x\not\in A$ and $x\in X,x\not\in B$ , so it follows that $x\in(X-A)\cap(X-B)$ . Hence $X-(A\cup B)\subset(X-A)\cap(X-B)$ .

Now let $x\in(X-A)\cap(X-B)$ . Then $x\in X-A$ and $x\in X-B$ . By definition of set difference, $x\in X,x\not\in A$ and $x\in X,x\not\in B$ . Since $x\not A,x\not\in B$ , we have $x\not\in(A\cup B)$ , and so $x\in X-(A\cup B)$ . Hence $(X-A)\cap(X-B)\subset X-(A\cup B)$ .

The two sets are subsets of one another, so they must be equal.

$X-\left(\bigcup\limits_{i\in I}A_i\right)=\bigcap\limits_{i\in I}(X-A_i)$

The proof of this is the same as above, you just have to indicate that membership, of lack thereof, holds for all indices $i\in I$ .

Proof of one direction for example:

Let $x\in X-\left(\bigcup\limits_{i\in I}A_i\right)$ . Then $x\in X$ and $x\not\in\bigcup\limits_{i\in I}A_i$ , which in turn means $x\not\in A_i$ for all $i\in I$ . This means $x\in X,x\not\in A_{i_1}$ , and $x\in X,x\not\in A_{i_2}$ , and so on, where $\{i_1,i_2,\ldots\}\subset I$ , for all $i\in I$ . This means $x\in X-A_{i_1}$ , and $x\in X-A_{i_2}$ , and so on, so $x\in\bigcap\limits_{i\in I}(X-A_i)$ . Hence $X-\left(\bigcup\limits_{i\in I}A_i\right)\subset\bigcap\limits_{i\in I}(X-A_i)$ .