All categories

3 years ago

I need to know the answer

Mathematics

2 answers:

solniwko [45]3 years ago

4 0

X-3/8=-1/4
+3/8
x=-1/4+3/8
make both bottom numbers the same so you are able to add them
-1/4×2/2= -2/8
x=-2/8+3/8
x=1/8

faltersainse [42]3 years ago

4 0

X - 3/8 = -1/4

x = -1/4 + 3/8

x = -2/8 + 3/8

x = 1/8

You might be interested in

What is the scientific notation of 68000

Dmitry [639]

OOHHH!! I like sci not! Okay, so you take the decimal ( which in this case is at the end: 68000. ) and move it over as many times as needed until it gets in between the, in this case, 6 and 8. ( 6.8000 ). You need to show exactly how many times it was actually moved so you multiply that number time 10^ whatever place. In this question, it'll be to the 4th place because you move the decimal over 4 times. The answer will be 6.80 x 10^4 OR -written in short hand- 6.8x10E4

8 0

3 years ago

Read 2 more answers

Geomertric sequence- A bank account earns a constant rate of interest each month. The account was opened on March 1 aith $18,000

kifflom [539]

A₀ = 18 000(1 + 0.0025)⁰
A₁ = 18 000(1 + 0.0025)¹
A₂ = 18 000(1 + 0.0025)²
A(n) = 18 000(1 + 0.0025)ⁿ

So, after 5 months, A(n) = 18 000(1 + 0.0025)⁵ = $18 226.1278 ≈ 18 226.13

5 years is 60 months.

A₆₀ = 18 000(1 + 0.0025)⁶⁰ = $20 909.1021 ≈ $20 909.10

8 0

3 years ago

What is the output of the function f(p) = 3p – 2 when the input is 2? A. 0 B. 2 C. 4 D. 6 E. 8

bazaltina [42]

Step-by-step explanation:

$f(p) = 3p - 2$

$f(2) = 3(2) - 2$

$f(2) = 6 - 2$

$f(2) = 4$

Answer: Option C, 4

8 0

3 years ago

Read 2 more answers

In a chess variant, a "lord" can move one space at a time, either upward, or to the right, or diagonally up and to the right. ho

valentina_108 [34]

There are 48639 ways for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard

<h3>Further explanation</h3>

The probability of an event is defined as the possibility of an event occurring against sample space.

$\large { \boxed {P(A) = \frac{\text{Number of Favorable Outcomes to A}}{\text {Total Number of Outcomes}} } }$

<h2>Permutation ( Arrangement )</h2>

Permutation is the number of ways to arrange objects.

$\large {\boxed {^nP_r = \frac{n!}{(n - r)!} } }$

<h2>Combination ( Selection )</h2>

Combination is the number of ways to select objects.

$\large {\boxed {^nC_r = \frac{n!}{r! (n - r)!} } }$

Let us tackle the problem.

This problem is similar to Pascal Triangle.

The Lord can move to the right or up in one way only.

We can put "1" in each box on the bottom and left to represent 1 possible movement.

To get the possibility of movement to another box, we will add the possibility of movement to the left, right, and diagonal squares as shown in Figure 1.

This process is repeated for the next box as shown in Figure 2.

Finally, after this process is repeated until the top right box, we get the results as shown in Figure 3.

There are 48639 ways for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard.

<h3>Learn more</h3>