Mod(z-25i)<15, Mathematics

Assignment Help:

Mod(Z-25i)<15 then diffrence of min,max of argZ
 

Sol) mod (Z-25i)<15,
means Z lies in the circumference of the circle with (0,25) at its centre and radius less then 15.
so difference in the max and min value of arg Z is given by the angle between the common tangents to the circle from origin.
the length of the tangents are 20 units( root  [(25)^2 - (15)^2])

Hence the angle between y axis and a tangent is tan inverse (15/20) = tan inverse 3/4=37 degree.
hence the total diff. = angle between the tangents = 2 times the angle between the y axis and one of the tangents.

   =2.37=74 degree or 2.[tan inverse 3/4]

= 74 degree or [tan inverse (24/7) ]


Related Discussions:- Mod(z-25i)<15

Explain polynomials, P OLYNOMIALS : It is  not  once  nor  twice  b...

P OLYNOMIALS : It is  not  once  nor  twice  but  times  without  number  that the  same ideas make  their  appearance in the  world. 1.  Find the value for K for which

Determine the probability, Determine the Probability From a pack of pl...

Determine the Probability From a pack of playing cards what is the probability of; (i)  Picking either a 'Diamond' or a 'Heart' → mutually exclusive (ii) Picking either

Write first-order formulas over the relational symbols, Consider the unary ...

Consider the unary relational symbols P and L, and the binary relational symbol On, where P(a) and I(a) encode that a is a point and a (straight) line in the 2-dimensional space, r

Management, Discuss demanding total market demand verus gaing market share

Discuss demanding total market demand verus gaing market share

Smith keeps track of poor work, Smith keeps track of poor work. Often on af...

Smith keeps track of poor work. Often on afternoon it is 5%. If he checks 300 of 7500 instruments what is probability he will find less than 20 substandard?

Linear programming, function [x, z] = readSolution(tableau, basis)

function [x, z] = readSolution(tableau, basis)

Analysis of algorithm running time - undirected graph, Problem. You are giv...

Problem. You are given an undirected graph G = (V,E) in which the edge weights are highly restricted. In particular, each edge has a positive integer weight of either {1, 2, . .

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd