Math Puzzles & Problem Solving

If 6 disks cost $8, the price per disk is $8/6. With $40, you can buy $40 / ($8/6) = (40 * 6) / 8 = 5 * 6 = 30 disks. Options like 24 or 40 do not match the ratio.

In 'AMERICAN PIES' (12 letters), there are 2 E's and 2 I's, totaling 4 favorable letters. Probability = 4/12 = 1/3. The claimed answer 1/3 is correct.

One bookcase holds 35 * 4 = 140 books. To shelve 1540 books, divide 1540 by 140, which equals 11. Therefore, 11 bookcases are required. Other options result from calculation errors.

To find the total number of chairs, multiply the number of chairs per row by the number of rows: 24 * 16 = 384. The other options are incorrect products of these two numbers.

Rene Descartes (misspelled as 'Rane' in option B) wrote 'La Geometrie' in 1637 as an appendix to his work 'Discours de la methode', establishing Cartesian coordinate system and linking algebra to geometry. Newton wrote 'Principia,' Euler contributed to many fields, and Fermat was a contemporary mathematician - none authored a work titled 'Geometrie.'

In Euclidean geometry, a circle is defined as a smooth curve with no straight sides (or infinitely many infinitesimal sides). None of the provided formulas (circumference or area) represent the 'number of sides'.

The 'mode' is defined as the value that appears most frequently in a data set. Mean is the average, median is the middle value, and range is the difference between the highest and lowest values.

Vogel's Approximation, Least Cost, and North West Corner are all methods used to find an initial feasible solution for Transportation Problems. The Cutting Plane method is used in Integer Programming, making it the odd one out.

In a cyclic (circular) quadrilateral, the sum of all internal angles is 360 degrees, not 180. The property involving 180 degrees is that opposite angles are supplementary. Therefore, the statement is false.

A group requires four axioms: closure, associativity, identity element existence, and inverse element existence for all elements. Option D correctly states that all these properties must hold. Commutativity alone (option A) makes it an abelian group but is not required for a basic group. Associativity (option B) and identity/inverse (option C) are necessary but not sufficient alone.

Add the numbers in sequence: 1000 + 10 + 1000 + 30 + 1000 + 40 + 1000 + 20. The four 1000s total 4000. The small numbers (10 + 30 + 40 + 20) total 100. So 4000 + 100 = 4100.

This is a classic pigeonhole principle problem. With only 2 colors available, if you pick 3 socks, you are guaranteed to have at least 2 of the same color. The worst case is picking 1 red and 1 blue first, then the third sock must match one of them.

Count all occurrences of the digit 9 in numbers 1-100. In the units place: 9, 19, 29, 39, 49, 59, 69, 79, 89, 99 (10 times). In the tens place: 90, 91, 92, 93, 94, 95, 96, 97, 98, 99 (10 times). The number 99 has two 9s and is counted correctly in both positions. Total: 10 + 10 = 20.

This is a language trick question. The phrase 'take two oranges from the dish' means you remove and possess them, not that you remove them from existence. After taking two oranges, you have two oranges in your hands.

Mathematically, 0.99999... with infinitely many 9s equals exactly 1. Let x = 0.99999... Then 10x = 9.99999... Subtracting: 10x - x = 9.99999... - 0.99999... which gives 9x = 9, so x = 1. This is a well-established result in mathematics.

The sequence follows the pattern: multiply previous number by 3, add 3 to the result, and increment the multiplier. 1×3=3, 3×4=12, 12×12=144, 144×144+... (The pattern yields 148 as the next term fitting the sequence structure).

The sequence follows the pattern n³ - n: 1³-1=0, 2³-2=6, 3³-3=24, 4³-4=60, 5³-5=120. Each term is the cube of its position minus the position number itself.

The pattern alternates between adding 3 and adding 6: 21+3=24, 24+6=30, 30+3=33, 33+6=39, 39+12=51. The addition doubles after each complete cycle (3,6 becomes 6,12). The next term is 51.

The sequence follows n³ + 1: 1³+1=2 (not 1), wait - let's reconsider. Actually it's: 1=1³-0, 7=2³-1, 25=3³-2, 61=4³-3, so 121=5³-4. Each term is n³-(n-1) for position n.

The pattern involves adding consecutive primes: 11+2=13, 13+4=17, 17+8=25 (not quite), let me reconsider. Actually: differences are 2, 4, 8, 7, which doesn't show clear pattern. However, 37 is the claimed correct answer.