All categories

3 years ago

Can someone help please

Mathematics

1 answer:

vova2212 [387]3 years ago

7 0

Answer:

24sq.ft

Step-by-step explanation:

<h3>Area of a parallelogram = Base*Height</h3>

Here,

→Base = 6ft, Height = 4ft

→ 6*4ft

→24sq.ft

<h3 /><h3>While writing area of a figure, we have to express the area in sq which means square</h3>

<h2> <em>ThankYou</em></h2>

<em>Please mark me as brainliest</em>

You might be interested in

How do you solve this A-4=

shusha [124]

There is not enough information to solve the problem.

4 0

3 years ago

Find n for which the nth iteration by the Bisection Method guarantees to approximate the root of f(x) = 2x^2 − 3x − 2 on [−2, 1]

Lady_Fox [76]

Answer:

n = 29 iterations would be enough to obtain a root of $f(x)=2x^2-3x-2$ that is at most $10^{-8}$ away from the correct solution.

Step-by-step explanation:

You can use this formula which relates the number of iterations, n, required by the bisection method to converge to within an absolute error tolerance of ε starting from the initial interval (a, b).

$n\geq \frac{log(\frac{b-a}{\epsilon} )}{log(2)}$

We know

a = -2, b = 1 and ε = $10^{-8}$ so

$n\geq \frac{log(\frac{1+2}{10^{-8}} )}{log(2)}\\n \geq 29$

Thus, n = 29 iterations would be enough to obtain a root of $f(x)=2x^2-3x-2$ that is at most $10^{-8}$ away from the correct solution.

<u>You can prove this result by doing the computation as follows:</u>

From the information given we know:

$f(x)=2x^2-3x-2$
$\epsilon = 10^{-8}$

This is the algorithm for the Bisection method:

Find two numbers <em>a</em> and <em>b</em> at which <em>f</em> has different signs.
Define $c=\frac{a+b}{2}$
If $b-c\leq \epsilon$ then accept c as the root and stop
If $f(a)f(c)\leq 0$ then set <em>c </em>as the new<em> b</em>. Otherwise, set <em>c </em>as the new <em>a</em>. Return to step 1.

We know that $f(-2)=2(-2)^2-3(-2)-2=12$ and $f(1)=2(1)^2-3(1)-2=-3$ so we take $a=-2$ and $b=1$ then $c=\frac{-2+1}{2} =-0.5$

Because $1-(-0.5)\geq 10^{-8}$ we set $c=-0.5$ as the new <em>b.</em>

The bisection algorithm is detailed in the following table.

After the 29 steps we have that $6\cdot 10^{-9}\leq 10^{-8}$ hence the required root approximation is c = -0.50

8 0

3 years ago

If p is a statement, which of the statements is the negation of p?

VLD [36.1K]

Answer: Not p.
Reasoning: It is neither "and p" nor "or p" because it isn't a statement with more than one variable in it to combine p with. It is neither "p is false" nor "p is true" because negation of a variable has nothing to do with the truth value of the claim.
Hope this was helpful.

3 0

3 years ago

Let n>=1. <br> Prove by induction for all <br> n>=1 1+5+9+...+[4(n-1)+1]+[4n+1] = (n+1)(2n+1).

alexira [117]

Answer:

Proved

Step-by-step explanation:

Given

$1+5+9+...+[4(n-1)+1]+[4n+1] = (n+1)(2n+1)$