All categories

2 years ago

I need to find the surface area for this one pls help me

Mathematics

1 answer:

Alex2 years ago

4 0

Step-by-step explanation:

so, you got the volume but don't know how to find the surface area ? that is strange for me. what's the problem ?

the surface of a cube or rectangular prism consists of 6 sides that split (for a rectangular prism) into 3 pairs of equal sides :

top and bottom

left and right

front and back

all we need to do is calculate the areas of these 6 rectangles and add them up. that's it.

in our case

top and bottom : 5×4 × 2 = 20×2 = 40 in²

left and right : 4×4 × 2 = 16×2 = 32 in²

front and back : 5×4 × 2 = 40 in²

so, in total, the whole surface area of the prism is

40 + 32 + 40 = 112 in²

You might be interested in

Henri bought a swimsuit suit at a cost of $8. Which statements are true regarding the cost of the suit? Select three correct opt

kifflom [539]

Answer:

What are the choices?

Step-by-step explanation:

3 0

3 years ago

What will you get if you cut a triangle perpendiculary

swat32

Answer:

2 triangles ?

Step-by-step explanation:

sorry if i got this wrong, when you cut it through the middle connecting the ends it give you two triangles?

3 0

4 years ago

Read 2 more answers

From a point 18 feet from the base of a tower, a wire is stretched to an attachment 40 feet up the tower. A right triangle with

Tamiku [17]

To find the length of the wire, use the Pythagorean theorem

a^2 + b^2 = c^2
18^2 + 40^2 = c ^2
324 + 1600 = c^2
1924 = c^2
44 = c

The wire is approximately 44 feet.

8 0

4 years ago

Define the double factorial of n, denoted n!!, as follows:n!!={1⋅3⋅5⋅⋅⋅⋅(n−2)⋅n} if n is odd{2⋅4⋅6⋅⋅⋅⋅(n−2)⋅n} if n is evenand (

tekilochka [14]

Answer:

Radius of convergence of power series is $\lim_{n \to \infty}\frac{a_{n}}{a_{n+1}}=\frac{1}{108}$

Step-by-step explanation:

Given that:

n!! = 1⋅3⋅5⋅⋅⋅⋅(n−2)⋅n n is odd

n!! = 2⋅4⋅6⋅⋅⋅⋅(n−2)⋅n n is even

(-1)!! = 0!! = 1

We have to find the radius of convergence of power series:

$\sum_{n=1}^{\infty}[\frac{8^{n}n!(3n+3)!(2n)!!}{2^{n}[(n+9)!]^{3}(4n+3)!!}](8x+6)^{n}\\\\\sum_{n=1}^{\infty}[\frac{8^{n}n!(3n+3)!(2n)!!}{2^{n}[(n+9)!]^{3}(4n+3)!!}]2^{n}(4x+3)^{n}\\\\\sum_{n=1}^{\infty}[\frac{8^{n}n!(3n+3)!(2n)!!}{[(n+9)!]^{3}(4n+3)!!}](x+\frac{3}{4})^{n}\\$

Power series centered at x = a is:

$\sum_{n=1}^{\infty}c_{n}(x-a)^{n}$

$\sum_{n=1}^{\infty}[\frac{8^{n}n!(3n+3)!(2n)!!}{2^{n}[(n+9)!]^{3}(4n+3)!!}](8x+6)^{n}\\\\\sum_{n=1}^{\infty}[\frac{8^{n}n!(3n+3)!(2n)!!}{2^{n}[(n+9)!]^{3}(4n+3)!!}]2^{n}(4x+3)^{n}\\\\\sum_{n=1}^{\infty}[\frac{8^{n}4^{n}n!(3n+3)!(2n)!!}{[(n+9)!]^{3}(4n+3)!!}](x+\frac{3}{4})^{n}\\$

$a_{n}=[\frac{8^{n}4^{n}n!(3n+3)!(2n)!!}{[(n+9)!]^{3}(4n+3)!!}]\\\\a_{n+1}=[\frac{8^{n+1}4^{n+1}n!(3(n+1)+3)!(2(n+1))!!}{[(n+1+9)!]^{3}(4(n+1)+3)!!}]\\\\a_{n+1}=[\frac{8^{n+1}4^{n+1}(n+1)!(3n+6)!(2n+2)!!}{[(n+10)!]^{3}(4n+7)!!}]$

Applying the ratio test:

$\frac{a_{n}}{a_{n+1}}=\frac{[\frac{32^{n}n!(3n+3)!(2n)!!}{[(n+9)!]^{3}(4n+3)!!}]}{[\frac{32^{n+1}(n+1)!(3n+6)!(2n+2)!!}{[(n+10)!]^{3}(4n+7)!!}]}$

$\frac{a_{n}}{a_{n+1}}=\frac{(n+10)^{3}(4n+7)(4n+5)}{32(n+1)(3n+4)(3n+5)(3n+6)+(2n+2)}$

Applying n → ∞

$\lim_{n \to \infty}\frac{a_{n}}{a_{n+1}}= \lim_{n \to \infty}\frac{(n+10)^{3}(4n+7)(4n+5)}{32(n+1)(3n+4)(3n+5)(3n+6)+(2n+2)}$

The numerator as well denominator of $\frac{a_{n}}{a_{n+1}}$ are polynomials of fifth degree with leading coefficients:

$(1^{3})(4)(4)=16\\(32)(1)(3)(3)(3)(2)=1728\\ \lim_{n \to \infty}\frac{a_{n}}{a_{n+1}}=\frac{16}{1728}=\frac{1}{108}$

4 0

3 years ago

Suppose that you pick a bit string from the set of all bit strings of length ten. Find the probability that a) the bit string ha

emmasim [6.3K]

Answer:

45/1024
1/4
15/128
193/512
9/512

Step-by-step explanation:

There are 2^10 = 1024 bit strings of length 10.

a) There are 10C2 = 45 ways to have exactly two 1-bits in 10 bits

p(2 1-bits) = 45/1024

b) Of the four (4) possibilities for beginning and ending bits (00, 01, 11, 10), exactly one (1) of those is 00.

p(b0=0 & b9=0) = 1/4

c) There are 10C7 = 120 ways to have seven 1-bits in the bit string.

p(7 1-bits) = 120/1024 = 15/128

d) ∑10Ck {for k=0 to 4} = 386 is the total of the number of ways to have 0, 1, 2, 3, or 4 1-bits in the string. If there are more than that, there won't be more 0-bits than 1-bits

p(more 0 bits) = 386/1024 = 193/512

e) The string will have two 1-bits if it starts with 1 and there is a single 1-bit among the other 9 bits. There are 9 ways that can happen, among the 512 ways to have 9 remaining bits.

p(2 1-bits | first is a 1-bit) = 9/512

6 0

3 years ago