Class VI Mathematics Half-Yearly Exam
Uploaded by
Soumili ChatterjeeClass VI Mathematics Half-Yearly Exam
Uploaded by
Soumili ChatterjeeCommon questions
Powered by AITo divide a line segment AB of length 10 cm into 4 equal parts, use a ruler and a compass. Start by drawing a 10 cm line segment. Use the compass set to a comfortable radius to mark points on the line, dividing AB. For equal divisions, repeatedly step the same compass width or use the construction method where auxiliary parallel lines help intersect equal arc lengths based on needed divisions .
Subtract the remainders from each number: 398 - 7 = 391, 496 - 11 = 485, 542 - 15 = 527. Find the GCD of these results using the Euclidean algorithm: GCD(391, 485, 527). First, GCD of 391 and 485 is 1 (as they share no common prime factors). GCD of 1 and 527 remains 1. Hence, there's no single number except 1 giving remainders 7, 11, 15 for these dividends .
To ensure no sweets are left when distributed among these groups, calculate the LCM of the group sizes: LCM(16, 40, 72). Factorize each number: 16 = 2^4, 40 = 2^3 × 5, 72 = 2^3 × 3^2. The LCM takes the highest powers of all primes: 2^4, 3^2, 5, resulting in 720. Hence, 720 sweets are needed so that each group can receive an equal number with none left .
The sequence's rule is successive addition, incrementing by 3, then by increasing progressive 4, thus going: +3, +4, +5, +6. Starting at 25 (followed as additions): 25 + 3 → 28, 28 + 4 → 32, then 32 + 5 → 37, and 37 + 6 → 43. Next are: 43 + 7 → 50, 50 + 8 → 58, then 58 + 9 → 67, supporting the rule through arithmetic consistency .
The greatest number of five digits is 99,999. To find the LCM of 3, 5, 8, and 12, calculate their prime factors: 3, 5, 8 = 2^3, and 12 = 2^2 × 3. The LCM is 2^3 × 3 × 5 = 120. To find the greatest number less than 100,000 that fulfills the condition, subtract the remainder 2: 99,999 - 2 = 99,997, then divide: 99,997 ÷ 120 gives approximately 833 remainder 117. Therefore, 99,960 is the greatest number that when divided by these numbers, leaves a remainder of 2 .
The number 94518 is divisible by both 6 and 9. Since 6 = 2 × 3 and 9 = 3^2, 54, their product, equals 2 × 3 × 3^2 = 54. Therefore, for 94518 to be divisible by 54, it must be divisible by both 6 and 9 simultaneously, which it is. Hence, 94518 is divisible by 54 as it is divisible by all its prime factors .
The sum of all factors of a perfect number equals twice the number. This is because a perfect number's factors (including 1 and itself) add to two times the number. For instance, for the perfect number 28, divisors including itself sum to 56 (2 × 28), confirming it as perfect .
The sequence alternates between dividing by 4 and multiplying by 2. Starting from 400 (dividing by 4) gives 100, then multiplying by 2 gives 200, again dividing by 4 gives 50. To continue, next divide 50 by 4 to get 12.5, and multiplying by 2 gives 25 .
A palindromic number reads the same forwards and backwards. With digits 5, 6, and 7, six 3-digit palindromes can form: 555, 666, 777, 565, 676, 757, arranging as aba structure, digits a and b are identical. (A = True, R = Correct for given sets) Assertions maintain 6 configurations as palindromic, structure-specific arrangements .
Zero in arithmetic plays distinct roles: adding zero to a number doesn't alter it (identity), i.e., 1 + 0 ≠ 0. Multiplying gives zero (1 × 0 = 0). Zero divided by a number keeps it zero (0 ÷ 2 = 0). Subtraction makes a number zero (10 - 10 = 0). Hence, operations contextually reshape zero's impact, modifying number consistency based on arithmetic principles .