All categories

3 years ago

What is 1.2+d+0.4=9.7?

2 answers:

7 0

Since your solving for d, its actually quite simple to figure out.

First:

9.7 = 1.2 + d + 0.4

Add 1.2 and 0.4 together to get 1.6

1.2 + 0.4 = 1.6

Then, subtract 1.6 from 9.7

9.7 - 1.6 = 8.1

Finally, fill in the blank for d

1.2 + 8.1 + 0.4 = 9.7

so, d = 8.1

Hope that helps you!

Cloud [144]3 years ago

6 0

1.2 + d + 0.4 = 9.7

1.6 + d = 9.7

1.6 (-1.6) + d = 9.7 (-1.6)

d = 8.1

your answer is 8.1

hope this helps

You might be interested in

A factory has a linear cost function f(x)=ax+b where b represents fixed costs and a represents the labor and material costs of m

kotegsom [21]

C . the graph will shift upwards because it is increasing on a graph

3 0

4 years ago

Read 2 more answers

Which system of equations can be graphed to find the solution(s) to...

Jobisdone [24]

Answer:

Step-by-step explanation:

7 0

3 years ago

Find the inverse function? I need help.

Tatiana [17]

Super easy. Take the function, and replace X with Y and Y with X. For example, if Y=12/x, then the inverse would be X=12/Y. Now solve for Y, so XY=12, the Y=12/x.

6 0

3 years ago

Find the smallest 4 digit number such that when divided by 35, 42 or 63 remainder is always 5

alex41 [277]

The smallest such number is 1055.

We want to find $x$ such that

$\begin{cases}x\equiv5\pmod{35}\\x\equiv5\pmod{42}\\x\equiv5\pmod{63}\end{cases}$

The moduli are not coprime, so we expand the system as follows in preparation for using the Chinese remainder theorem.

$x\equiv5\pmod{35}\implies\begin{cases}x\equiv5\equiv0\pmod5\\x\equiv5\pmod7\end{cases}$

$x\equiv5\pmod{42}\implies\begin{cases}x\equiv5\equiv1\pmod2\\x\equiv5\equiv2\pmod3\\x\equiv5\pmod7\end{cases}$

$x\equiv5\pmod{63}\implies\begin{cases}x\equiv5\equiv2\pmod 3\\x\equiv5\pmod7\end{cases}$

Taking everything together, we end up with the system

$\begin{cases}x\equiv1\pmod2\\x\equiv2\pmod3\\x\equiv0\pmod5\\x\equiv5\pmod7\end{cases}$

Now the moduli are coprime and we can apply the CRT.

We start with

$x=3\cdot5\cdot7+2\cdot5\cdot7+2\cdot3\cdot7+2\cdot3\cdot5$

Then taken modulo 2, 3, 5, and 7, all but the first, second, third, or last (respectively) terms will vanish.

Taken modulo 2, we end up with

$x\equiv3\cdot5\cdot7\equiv105\equiv1\pmod2$

which means the first term is fine and doesn't require adjustment.

Taken modulo 3, we have

$x\equiv2\cdot5\cdot7\equiv70\equiv1\pmod3$

We want a remainder of 2, so we just need to multiply the second term by 2.

Taken modulo 5, we have

$x\equiv2\cdot3\cdot7\equiv42\equiv2\pmod5$

We want a remainder of 0, so we can just multiply this term by 0.

Taken modulo 7, we have

$x\equiv2\cdot3\cdot5\equiv30\equiv2\pmod7$

We want a remainder of 5, so we multiply by the inverse of 2 modulo 7, then by 5. Since $2\cdot4\equiv8\equiv1\pmod7$ , the inverse of 2 is 4.

So, we have to adjust $x$ to

$x=3\cdot5\cdot7+2^2\cdot5\cdot7+0+2^3\cdot3\cdot5^2=845$

and from the CRT we find

$x\equiv845\pmod2\cdot3\cdot5\cdot7\implies x\equiv5\pmod{210}$

so that the general solution $x=210n+5$ for all integers $n$ .

We want a 4 digit solution, so we want

$210n+5\ge1000\implies210n\ge995\implies n\ge\dfrac{995}{210}\approx4.7\implies n=5$

which gives $x=210\cdot5+5=1055$ .

5 0

3 years ago

The square of the sum 5 and 8

kipiarov [429]

$\underline{ \huge{ \red{Solution: }}} \\ \\ {(5 + 8)}^{2} \\ \\ = {13}^{2} \\ \\ = 169$

6 0

3 years ago