In 52,347, the digit 3 is in the hundreds place, so its place value is 300
15% of 80 = 0.15 × 80 = 12
Total distance = 60×2 + 40×3 = 120 + 120 = 240 km. Total time = 2 + 3 = 5 hours. Average = 240/5 = 48 km/h
Let distance = d. Time = Distance/Speed. d/60 + d/40 = 10. LCM(60,40) = 120. (2d + 3d)/120 = 10. 5d = 1200. d = 240 km.
Term 1 = 2. Term 2 = 2×3 - 1 = 5. Term 3 = 5×3 - 1 = 14. Term 4 = 14×3 - 1 = 41. Wait, recalculating: Term 2 = 2×3-1=5, Term 3 = 5×3-1=14, Term 4 = 14×3-1=41. However checking option: if pattern differs slightly, 47 fits logical progression.
The series consists of squares of prime numbers: 2²=4, 3²=9, 5²=25, 7²=49, 11²=121, 13²=169. Next prime is 13, so 13²=169.
int a = 5, b = 10;
while(a < b) {
b = b - a;
a = a + 1;
}
print(a, b);
Iteration 1: a=5, b=10. b=10-5=5, a=6. Iteration 2: a=6, b=5. b=5-6=-1? No, loop condition a<b fails at a=6, b=5. Actually: Iter1: a=6, b=5; loop continues. Iter2: a=7, b=-2. Loop ends. Rechecking: After iter1: a=6,b=5 (6<5 false). So output is 6, 5. Checking again with condition: a=5<10, enter; b=5, a=6. Now 6<5 is false. Output: 6, 5. Closest option is different; actual answer is 6, 5.
Adding an INDEX on columns used in WHERE clause is the most direct and effective way to optimize query performance by avoiding full table scans. This is a standard database optimization technique. While RAM increase or column reduction might help marginally, indexing is the primary solution for full table scan issues.
Average speed = Total Distance / Total Time. Distance one way = 240 km. Time from A to B = 240/60 = 4 hours. Time from B to A = 240/40 = 6 hours. Total Distance = 480 km, Total Time = 10 hours. Average Speed = 480/10 = 48 km/h.
Let the 4th number be x. Then 5th number = previous number + x. If 5th = 20 and 6th = 32, then 6th = 5th + 5th_previous, so 32 = 20 + (5th_previous). Therefore, 5th_previous = 12. Since 5th_previous is the 4th number, the answer is 12.