# A 24 foot ladder forms a 76 degree angle with the ground

###### Question:

A 24 foot ladder forms a 76 degree angle with the ground. The top of the ladder rests against the building. To the nearest inch how high up the building does the ladder reach?

#### Similar Solved Questions

##### Using the results r(128) = .34, p > .05, what is sr? A. .18 B. .08...
Using the results r(128) = .34, p > .05, what is sr? A. .18 B. .08 C. .09 D. .01...
##### Which of the following contains the largest mass percent hydrogen? a.10.0 g H2S b.10.0 g H2O...
Which of the following contains the largest mass percent hydrogen? a.10.0 g H2S b.10.0 g H2O c.10.0 g C2H6 d.10.0 g CH4...
##### N to the Owens Valley 1632 m below. If the 21.0 m along the road to...
n to the Owens Valley 1632 m below. If the 21.0 m along the road to the top of the hill. If the cyclist's initial speed is 9.30 m/s, what is the final speed? Ignore friction and air...
##### Simplify the expressions below as much as possible. Leave no negative numbers under radicals and no...
Simplify the expressions below as much as possible. Leave no negative numbers under radicals and no radicals in denominators. ✓-5. V-15 II . V-8 va X ?...
##### Paragraph - Individual 5 The 2 alleles at the ALK locus are denoted ALK+ and ALK....
Paragraph - Individual 5 The 2 alleles at the ALK locus are denoted ALK+ and ALK. The 3 alleles at the ABO blood group locus are A, B (co-dominant) and 0 (the 0 allele is recessive to A and B). Example: Individual 5 has a genotype of ALK-ALK- for alkaptonuria and 00 for blood type Genotype Individua...
##### Hello please how do I answer this question: Review of descriptive epidemiologic and demographic data on...
Hello please how do I answer this question: Review of descriptive epidemiologic and demographic data on mortality and morbidity and risk of hookah? I need to understand what I am expected to write...
##### True or False? Explain why? The problem of finding a shortest path in a graph can...
True or False? Explain why? The problem of finding a shortest path in a graph can be polynomially reduced to an instance of the integer knapsack problem...