son- b/t 3 and 4 dad- b/t 36 and 48
Let's say Bill = b and Tom= t We can make an equation like this from the question. 2b = 10 + t t= b +15 Since t = b+ 15 you can substitute that into the first equation making it 2b= 10 + (b + 15) 2b= 25+ b b= 25 So now we know bill is 25 inches tall now subsitute that into the sencond equation t=(25) + 15 = 40 Now we know that Tom is 40 inches tall Bill= 25 inches Tom= 40 inches
The two integers are A and A+40 or, equivalently, B and B-40.
Let T = temperature T is less than 40 degrees. T < 40 degrees
17 letters between B and T.
40 thieves with Ali Baba
Ff
Ali Baba and the 40 thieves is the answer.
Ali Baba and the Forty Thieves
5 continents of the world
son- b/t 3 and 4 dad- b/t 36 and 48
Let's say Bill = b and Tom= t We can make an equation like this from the question. 2b = 10 + t t= b +15 Since t = b+ 15 you can substitute that into the first equation making it 2b= 10 + (b + 15) 2b= 25+ b b= 25 So now we know bill is 25 inches tall now subsitute that into the sencond equation t=(25) + 15 = 40 Now we know that Tom is 40 inches tall Bill= 25 inches Tom= 40 inches
When B is given a 40metre start then B runs 960m in T secs and A runs 1000m in T-19 secs. When B is given a 30 second start then B runs 1000m in t secs and A runs 960m in t - 30 secs. Assume that the speed of A (Va) and B (Vb) is constant in both situations. Then Vb = 960 ÷ T = 1000 ÷ t, and Va = 1000 ÷ (T - 19) = 960 ÷ (t - 30) So 960t = 1000T, and 1000t - 30000 = 960T - 18240. Then 40t = -40T + 11760, t = -T + 294. Substituting for t in 960t = 1000T gives : -960T + 282240 = 1000T : 1960T = 282240 : T = 144 B 's speed is 960 ÷ T = 960 ÷ 144 = 6.67 metres per second. Assuming the same constant speed to run 5000 metres then the time taken is 5000 ÷ 6.67 = 750 seconds
About 2 lakh crore rupees. that is 40 billion us dollars
its the t and the b
// recursive algorithm to return gcd using Euclid's Algorithm int gcd (int a, int b) { if (a<0) a= -a; if (b<0) b= -b; if (a<b) { int tmp; tmp= a; a= b; b= tmp; } if (b == 0) return a; return gcd (b, a%b); } // LCM using gcd int LCM (int a, int b) { int t; t = a*b; if (t<0) t=-t; return t / gcd (a, b); }
The two integers are A and A+40 or, equivalently, B and B-40.