All categories

2 years ago

Round your answer to the nearest hundredth.

Mathematics

1 answer:

Karolina [17]2 years ago

3 0

Answer:

tam 20 = 4 / x

x = 4 /tan 20 = 4 / .364 = 10.99

You might be interested in

Help me with this question plz! I am really confused n strangled in it! although it seems easy I am not able to do...

SVEN [57.7K]

Answer:

please type out question as unclear to see :)

3 0

3 years ago

Identify the Pythagorean triple.

Phantasy [73]

Answer:

I'm almost positive it's .A but I'm not sure

4 0

3 years ago

Read 2 more answers

What is 20.9/9.31? No need to explain. Just need the answer

Furkat [3]

2.24489795918
Is the answer

3 0

3 years ago

Read 2 more answers

Multiply or divide. Show your work 5x+10 . 2x _____ ___ x+2 4x-10

sp2606 [1]

$\frac{2x(5x+10)}{(x+2)(4x-10)} = \frac{10x(x+2)}{2(x+2)(2x-5)} = \frac{5x}{2x+5}$

8 0

3 years ago

Given that 'n' is a natural number. Prove that the equation below is true using mathematical induction.

LenaWriter [7]

<h3>To ProvE :- </h3>

1 + 3 + 5 + ..... + (2n - 1) = n²

Method :-

If P(n) is a statement such that ,

P(n) is true for n = 1
P(n) is true for n = k + 1 , when it's true for n = k ( k is a natural number ) , then the statement is true for all natural numbers .

$\sf\to \textsf{ Let P(n) : 1 + 3 + 5 + $\dots$ +(2n-1) = n$^{\sf 2}$ }$

Step 1 : Put n = 1 :-

$\sf\longrightarrow LHS = \boxed{\sf 1 } \\$

$\sf\longrightarrow RHS = n^2 = 1^2 = \boxed{\sf 1 }$

Step 2 : Assume that P(n) is true for n = k :-

$\sf\longrightarrow 1 + 3 + 5 + \dots + (2k - 1 ) = k^2$

Add (2k +1) to both sides .

$\sf\longrightarrow 1 + 3+5+\dots+(2k-1)+(2k+1)=k^2+(2k+1)$

RHS is in the form of ( a + b)² = a²+b²+2ab .

$\sf\longrightarrow 1 + 3+5+\dots+(2k-1)+(2k+1)= (k +1)^2$

Adding and subtracting 1 to LHS .

$\sf\longrightarrow 1 + 3+5+\dots+(2k-1)+(2k+1) + 1 -1 = (k +1)^2 \\$

$\sf\longrightarrow 1 + 3+5+\dots+(2k-1)+(2k+2) - 1 = (k +1)^2$

Take out 2 as common .

$\sf\longrightarrow 1 + 3+5+\dots+(2k-1)+\{2(k+1)-1\}= (k +1)^2$

P(n) is true for n = k + 1 .

Hence by the principal of Mathematical Induction we can say that P(n) is true for all natural numbers 'n' .

**Edits are welcomed**

8 0

2 years ago

Read 2 more answers