Skip to main content

Work and Time

Work and Time
In this post, we will learn about work and time concept because there is not any standard formula for the problem which fall in work and time category we will understand it with example.

Anil can do a job in 20 days. Babu can do the same job in 5 days. In how many days they can complete the job if they work together?
  1. 4
  2. 5
  3. 6
  4. 7
Solution:
 Efficiency of Anil = (100/20) = 5  
 Efficiency of Babbu = (100/5) = 20  
 Efficiency together = Efficiency of Anil + Efficiency of Babbu = 25  
 it means together they can finish 25% of work in one day  
 For so to finish 100% work they will take (100/25) = 4 Day  
Efficiency = 100/time

Anil and Babu can do a job in 8 days. Babu and Charan can do the same job in 12 days. Anil, Babu and Charan can do the job in 6 days. In how many days Anil and Charan can complete the job?
  1. 8
  2. 7
  3. 6
  4. 5
 Anil and Babu efficiency = (100/8) = 12.5  
 Babu and Charan efficiency = (100/12) = 8.33  
 Anil, Babu and Charan efficiency = (100/6) = 16.66  
 efficiency of Anil = efficiency of (Anil + Babu + charan) - efficiency of (Babu + Charan)   
                    = 16.66 - 12.5 = 4.16  
 efficiency of Charan = efficiency of (Anil + Babu + charan) - efficiency of (Anil + Babu)   
                      = 16.66 – 8.33 = 8.33  
 Anil and charan efficiency = efficiency of Anil + efficiency of Charan  
                            = 4.16 + 8.33 = 12.5  
 So Anil and Charan together take 100/12.5 = 8 Day  

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. 


Comments

Popular posts from this blog

Clique in Graph

Clique in Graph In this tutorial, we will learn about the clique in the graph theory. Clique In graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Equations

In general we frame real life problems into some mathematical formula called equations in which we use constant and some variables(unknown) Example: Ram is 12 years old.Ram 's age is 3/5 of Shyam's age what is Shyam's age. Let Shyam's age is x then 3/5 of sham's age is 3*x/5 x*3/5=12 x=60/3=20 so Shyam's age is 20. Linear equations When there is a linear combination of unknown variables is there then eqn is linear Example: 3x+ 2y+ 4z=9 Non Linear Equations: Equations in which non linear combination of the variable is there then eqn is non linear. When any 2 unknown variable multiplication present in the equation then it is the nonlinear equation. Example: 2x+5yz=98 is a nonlinear equation because yz multiplication is there: Quadratic equation in one variable: x^2 + 4*x + 2=0 is non linear because unknown variable x is being multiplied in term x^2 Quadratic equation in many variable: x^2 + y^2 +z^2 + w=0 cubic equati...

Practice Problem on Square Measurement

Practice Problem on Square Measurement What is the area of square having side length 5 unit? 25 unit 2     10 unit 25 unit 10 unit 2 What is the  perimeter of a square   having side length 5 unit? 20 unit 20 unit 2 10 unit 10 unit 2 What is the  diagonal  length of a square   having side length 5 unit? 5√2 unit     5√2 unit 2 10 unit 10 unit 2 What is the side length of square having area equal to  25 unit 2  ? 5 unit 5  unit 2 10 unit 10  unit 2 There is a petrol pump in a area having length and width equal to 500 meter. What will be cost to put bricks in the whole area if bricks having length and width equal to 5 cm and cost of 1 bricks is Rs 5? Rs 500000000 Rs 50000000 Rs 5000000 Rs 500000 Related Post:  Square Mensuration Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. ...

Vertex Cover

Vertex Cover In this tutorial, We will learn about the vertex cover in graph theory. Vertex Cover  A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either u or v is in vertex cover i.e minimum number of vertices that covers all edges of the given graph. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.