All categories

2 years ago

What is the equation of a line that is parallel to x−2y=−4 and passes through the point (0, 0) ?

2 answers:

6 0

<span>Find an equation for the line parallel to 2y+4x = 8 and goes through the point (-3,3). Write your answer in the form y=mx+b.</span>

castortr0y [4]2 years ago

5 0

Find x when y is 0 it will help trust me it help me.

You might be interested in

Can you Help me out plz!!

Klio2033 [76]

Answer:

14)

21√2

15)

Leg: 7√3

Hypotenuse: 14

Step-by-step explanation:

The hypotenuse is √2 as long as each leg. That means the leg is 42/√2. Simplified to make 21√2.

The hypotenuse is always twice as long as the shortest leg on a 30-60-90 triangle. The longer leg is √3 as long as the shortest side.

4 0

3 years ago

The price of a gallon of unleaded gas was $2.83 yesterday. Today, the price fell to $2.78 . Find the percentage decrease. Round

avanturin [10]

2.105% is the answer!

8 0

3 years ago

Given a point on a line and the equation of a parallel or perpendicular line, write the equation of the line in point-slope form

Arlecino [84]

Answer: y - 5 = 0(x - 1)

==================================================

Explanation:

Recall that point slope form in general is written as such

y - y1 = m(x - x1)

where,

m is the slope

(x1,y1) is the point the line goes through

The given equation y = 7 can be written as y = 0x+7. So we see that this line has a slope of m = 0

Plug m = 0 along with the given point (x1,y1) = (1,5) into the point slope equation and we get

y - y1 = m(x - x1)

y - 5 = 0(x - 1)

which is the final answer

note: the equation in bold can be rearranged and simplified to get y = 5; however your teacher seems to want the answer in point-slope form, so we leave it as such.

6 0

2 years ago

Consider writing onto a computer disk and then sending it through a certifier that counts the number of missing pulses. Suppose

Furkat [3]

Answer:

a) 0.164 = 16.4% probability that a disk has exactly one missing pulse

b) 0.017 = 1.7% probability that a disk has at least two missing pulses

c) 0.671 = 67.1% probability that neither contains a missing pulse

Step-by-step explanation:

To solve this question, we need to understand the Poisson distribution and the binomial distribution(for item c).

Poisson distribution:

In a Poisson distribution, the probability that X represents the number of successes of a random variable is given by the following formula:

$P(X = x) = \frac{e^{-\mu}*\mu^{x}}{(x)!}
$

In which

x is the number of sucesses

$
e = 2.71828$ is the Euler number

$\mu$ is the mean in the given interval.

Binomial distribution:

The binomial probability is the probability of exactly x successes on n repeated trials, and X can only have two outcomes.

$P(X = x) = C_{n,x}.p^{x}.(1-p)^{n-x}$

In which $C_{n,x}$ is the number of different combinations of x objects from a set of n elements, given by the following formula.

$C_{n,x} = \frac{n!}{x!(n-x)!}$

And p is the probability of X happening.

Poisson mean:

$\mu = 0.2$

a. What is the probability that a disk has exactly one missing pulse?

One disk, so Poisson.

This is P(X = 1).

$P(X = 1) = \frac{e^{-0.2}*0.2^{1}}{(1)!} = 0.164
$

0.164 = 16.4% probability that a disk has exactly one missing pulse

b. What is the probability that a disk has at least two missing pulses?

$P(X \geq 2) = 1 - P(X < 2)$

In which

$P(X < 2) = P(X = 0) + P(X = 1)$

In which

$P(X = x) = \frac{e^{-\mu}*\mu^{x}}{(x)!}
$

$P(X = 0) = \frac{e^{-0.2}*0.2^{0}}{(0)!} = 0.819$

$P(X = 1) = \frac{e^{-0.2}*0.2^{1}}{(1)!} = 0.164
$

$P(X < 2) = P(X = 0) + P(X = 1) = 0.819 + 0.164 = 0.983$

$P(X \geq 2) = 1 - P(X < 2) = 1 - 0.983 = 0.017$

0.017 = 1.7% probability that a disk has at least two missing pulses

c. If two disks are independently selected, what is the probability that neither contains a missing pulse?

Two disks, so binomial with n = 2.

A disk has a 0.819 probability of containing no missing pulse, and a 1 - 0.819 = 0.181 probability of containing a missing pulse, so $p = 0.181$

We want to find P(X = 0).

$P(X = x) = C_{n,x}.p^{x}.(1-p)^{n-x}$

$P(X = 0) = C_{2,0}.(0.181)^{0}.(0.819)^{2} = 0.671$

0.671 = 67.1% probability that neither contains a missing pulse

8 0

2 years ago

Without using a division or multiplication operator and without using iteration , define a recursive method named product that a

Fantom [35]

I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}

8 0

2 years ago