All categories

2 years ago

Assistance if you please?

Mathematics

1 answer:

dybincka [34]2 years ago

7 0

Answer:

38°

Step-by-step explanation:

a whole circle is equal to 360 degrees so if 52 +90= 142 the opposite side also equals 142 because they are clearly the same size. ED and AB are also the same sizes. if 360- (142+142) = 284. then you will have to divide 284 by 2. so 284÷2=76 and 76÷2=38°

hope you understand, I not that good at explaining things

also I don't know what the m means in mED

You might be interested in

Coefficient of b in expansion of (3+b)^4

Margarita [4]

Are you sure you want ONLY the coefficient of b? If you expand this, you will have b in 3 of 4 terms.

According to Pascal's Triangle, the coefficients of (a+b)^4 are as follows:

1
1 2 1
1 3 3 1
1 4 6 4 1

So (a+b)^4 would be 1a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4

Here, you want (3 + b)^4. Here's what that looks like:

3^4 + 4[3^3*b] + 6[3^2*b^2] + 4[3*b^3] + 1[b^4]

Which coeff did you want?

4 0

3 years ago

Let X1 and X2 be two random variables following Binomial distribution Bin(n1,p) and Bin(n2,p), respectively. Assume that X1 and

ryzh [129]

Answer:

a) X1+X2 have distribution Bi(n1+n2, p)

P(X1+X2 = 1 | X2 = 0) = np(1-p)ⁿ¹⁻¹

P(X1+X2 = 1| X2 = 1) = (1-p)ⁿ¹

P(X1 + X2 = 1) = (1-p)ⁿ¹ * np(1-p)ⁿ²⁻¹+ (1-p)ⁿ²*np(1-p)ⁿ¹-¹

Step-by-step explanation:

Since both variables are independent but they have the same probability parameter, you can interpret that like if the experiment that models each try in both variables is the same. When you sum both random variables toguether, what you obtain as a result is the total amount of success in n1+n2 tries of the same experiment, thus X1+X2 have distribution Bi(n1+n2, p).

Note that, if X2 = k, then X1+X2 = 1 is equivalent to X1 = 1-k. Since X1 and X2 are independent, then P(X1+X2 = 1| X2 = K) = P(X1=1-k|X2=k) = P(X1 = 1-k).

If k = 0, then this probability is equal to P(X1 = 1) = np(1-p)ⁿ¹⁻¹

If k = 1, then it is equal to P(X1 = 0) = (1-p)ⁿ¹

Thus,

P(X1+X2 = 1) = P(X1+X2 = 1| X2 = 1) * P(X2=1) + P(X1+X2 = 1| X2 = 0) * P(X2 = 0) = (1-p)ⁿ¹ * np(1-p)ⁿ²⁻¹+ (1-p)ⁿ²*np(1-p)ⁿ¹-¹

4 0

3 years ago

2 pounds equals how many onces

Semenov [28]

There are 16 oz in a pound, so 2 lbs is 32 oz.

4 0

2 years ago

Read 2 more answers

I need help with math, respond back if you can help me on any other platforms to help

erica [24]

Answer:

i can help on sc

Step-by-step explanation:

snap is realparisbaron

3 0

2 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