Home
Class 12
PHYSICS
Has a hypermetropic person problem in dr...

Has a hypermetropic person problem in driviong without specs?

Promotional Banner

Similar Questions

Explore conceptually related problems

A hypermetropic person prefers to remove his spectracles,while driving .Explain,why.

We an recoganise a person just by listening his voice and without seeing him.HOw ?

A 22 -year student goes to an opthalamologist .he has a problem in reading book because he is not able to contract his

A curved surface is shown in the figure. The portion BCD is free of friciton. There are three spherical balls of identical radii and masses. Balls are released from rest one by one from A which is at a slightly greater height than C. With the surface AB, ball 1 has large enough firction to cause rolling down without slipping, ball 2 has a small friction and ball 3 has a negligible frction. For which balls is total mechanical energy conserved?

A curved surface is shown in the figure. The portion BCD is free of friciton. There are three spherical balls of identical radii and masses. Balls are released from rest one by one from A which is at a slightly greater height than C. With the surface AB, ball 1 has large enough firction to cause rolling down without slipping, ball 2 has a small friction and ball 3 has a negligible frction. Which balls (s) can reach D?

A curved surface is shown in the figure. The portion BCD is free of friciton. There are three spherical balls of identical radii and masses. Balls are released from rest one by one from A which is at a slightly greater height than C. With the surface AB, ball 1 has large enough firction to cause rolling down without slipping, ball 2 has a small friction and ball 3 has a negligible frction. For balls which do nt each D, which of the balls an reach back A?

If a man rides his motor cycle at 25 km/hr, he has to spend Rs 2 per km on petrol, if he rides at a faster speed of 40 km/hr, the petrol cost increases to Rs 5 perkm. He has Rs 100 to spend on petrol and wishes to find maximum distance he can travel within one hour. Express this as a linear programming problem and then solve it graphically.