All categories

3 years ago

D= c-s/n solve for n

Mathematics

2 answers:

Zarrin [17]3 years ago

6 0

Step 1: d = c-s/n
Step 2: dn = c-s
Solution is n = c-s/d :-)

Masja [62]3 years ago

3 0

D=c-s/n
Subtract c too both sides
d-c=-s/n
Multiply -s too both sides
d-c*-s=n
Final answer
n=d-c*-s

You might be interested in

Please‼️help me<br>Myanmar Grade7

cricket20 [7]

Answer:

S/175 =18/21

21s=18×175

21s=3150

s=150

69/s =54/36

69×36 =54×s

2484=54s

s=46

5 0

3 years ago

Mr Smith has 50 papers to grade. He graded 38 papers and he had a scholar grade the rest what percent of the papers did each per

Jet001 [13]

First you will divide 100 by 50 you get 2. then you subrtact 38 from 50. you get 12. then since 100 is twice the amount as 50, you will multiply 12 by 2. you get 24. that is your answer

4 0

3 years ago

For Which Value of P and W is P+W a rational number. Tell me how you got that answer

Ymorist [56]

300.02 if you use the square root of 72

6 0

3 years ago

Read 2 more answers

Clouds are formed when millions of drops of water become suspended in the air. Which of the following is a step in the process o

Mnenie [13.5K]

Answer:

i have autism and adhd and add and dmdd so plz dont yell at me that i did not answer!!!!!

but please have a beautiful weekend!! :)

Step-by-step explanation:

3 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