1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
MrMuchimi
2 years ago
11

Heyyyyy pleasse help me please please and thank you

Mathematics
1 answer:
dimulka [17.4K]2 years ago
7 0

Answer:

x ≈ 33.1°

Step-by-step explanation:

Using the tangent ratio in the right triangle

tan x = \frac{opposite}{adjacent} = \frac{125}{192} , then

x = tan^{-1} ( \frac{125}{192} ) ≈ 33.1° ( to the nearest tenth )

You might be interested in
The perimeter of a square is 292 centimeters how long is each side
Marina CMI [18]
73 cm, the perimeter is all side totals, to to find each side length you just have to divide by 4 since all the sides of a square are the same
6 0
3 years ago
Read 2 more answers
• karger's min cut algorithm in the class has probability at least 2/n2 of returning a min-cut. how many times do you have to re
MrRissso [65]
The Karger's algorithm relates to graph theory where G=(V,E)  is an undirected graph with |E| edges and |V| vertices.  The objective is to find the minimum number of cuts in edges in order to separate G into two disjoint graphs.  The algorithm is randomized and will, in some cases, give the minimum number of cuts.  The more number of trials, the higher probability that the minimum number of cuts will be obtained.

The Karger's algorithm will succeed in finding the minimum cut if every edge contraction does not involve any of the edge set C of the minimum cut.

The probability of success, i.e. obtaining the minimum cut, can be shown to be ≥ 2/(n(n-1))=1/C(n,2),  which roughly equals 2/n^2 given in the question.Given: EACH randomized trial using the Karger's algorithm has a success rate of P(success,1) ≥ 2/n^2.

This means that the probability of failure is P(F,1) ≤ (1-2/n^2) for each single trial.

We need to estimate the number of trials, t, such that the probability that all t trials fail is less than 1/n.

Using the multiplication rule in probability theory, this can be expressed as
P(F,t)= (1-2/n^2)^t < 1/n 

We will use a tool derived from calculus that 
Lim (1-1/x)^x as x->infinity = 1/e, and
(1-1/x)^x < 1/e   for x finite.  

Setting t=(1/2)n^2 trials, we have
P(F,n^2) = (1-2/n^2)^((1/2)n^2) < 1/e

Finally, if we set t=(1/2)n^2*log(n), [log(n) is log_e(n)]

P(F,(1/2)n^2*log(n))
= (P(F,(1/2)n^2))^log(n) 
< (1/e)^log(n)
= 1/(e^log(n))
= 1/n

Therefore, the minimum number of trials, t, such that P(F,t)< 1/n is t=(1/2)(n^2)*log(n)    [note: log(n) is natural log]
4 0
3 years ago
I need help I’m on my last questionnn
LenKa [72]

Answer:

7.3 in

Step-by-step explanation:

Area of triangle = (1/2) *b*h

27 = (1/2) * x^2

54 = x^2

square root (54) = x

x=> 7.3484....

Rounding off to 1 decimal place, you get 7.3 in.

8 0
2 years ago
Read 2 more answers
Find the product. (n³) . (n⁵)⁴ ​
Alenkasestr [34]

Answer:

n^23

Step-by-step explanation:

n^3 · n^20 = n^23

6 0
3 years ago
What's the square root of 5
QveST [7]
The answer is 25 because
5*5=25
5 0
2 years ago
Read 2 more answers
Other questions:
  • Twice the difference of a number z and 12 is equal to 10
    10·2 answers
  • What number must you add to complete the square?<br> x^2 + 12x = 16
    14·2 answers
  • Which ordered pair is a solution to the system of equations? A (1,3) B (7, -5) C (8,2) D (-2, -3)
    9·1 answer
  • Im stuck on this question plz help
    8·2 answers
  • PLEASE HELP WITH FOLLOWING QUESTION
    8·1 answer
  • Chris has a job selling newspapers every morning. He received a base pay of $7.45 a day and also gets 15 cents for every paper h
    9·1 answer
  • Factorise the following expression :​
    11·1 answer
  • What is the are a square with a side length of 3x + 4.
    13·1 answer
  • If someone could help me out thank u!
    14·1 answer
  • -7 = (m-9/4 please show your work!
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!