11th Grade Mathematics Exam Paper
Uploaded by
namanmutha2411th Grade Mathematics Exam Paper
Uploaded by
namanmutha24Common questions
Powered by AIThe combined cardinality of the union of two sets A and B can be determined by the formula n(A ∪ B) = n(A) + n(B) - n(A ∩ B). This formula accounts for the principle of inclusion-exclusion, ensuring overlapping elements counted in both A and B are only counted once. Among the given options, the correct equation is n(A) + n(B) = n(A ∪ B) + n(A ∩ B) if considering the cardinality of individual set operations .
The binomial expansion can be used to prove identities such as 6^n - 5^n leaving a remainder of 1 when divided by 25 by expanding each term using the binomial theorem and modulo arithmetic. Essential steps include expressing each term in its expanded binomial form, identifying and simplifying terms modulo 25, ensuring that only terms contributing to the remainder are highlighted. The proof involves recognizing that for powers greater than 1, terms become divisible, ensuring the remainder is consistently 1 .
To solve inequalities involving absolute values, such as |x + 3| ≥ 10, we split the inequality into two separate cases: x + 3 ≥ 10 and x + 3 ≤ -10. Solving these gives x ≥ 7 and x ≤ -13, respectively. Therefore, the solution set is x ∈ (−∞, −13] ∪ [7, ∞), representing all values that satisfy either condition .
To determine the number of ways to form a committee of 3 men and 2 women from a group of 7 men and 5 women, we employ combinations. Calculate the combinations separately for men and women: choose 3 men from 7, which is C(7,3) = 35, and choose 2 women from 5, which is C(5,2) = 10. Multiply the results to get the total number of ways: 35 * 10 = 350 .
Given that 25 students play cricket, 20 play tennis, and 10 play both sports, the number of students who play either cricket or tennis can be found using the formula for union in set theory: n(A ∪ B) = n(A) + n(B) - n(A ∩ B), where A is the set of students who play cricket, and B is the set of students who play tennis. Applying the numbers: 25 + 20 - 10 = 35 students play either cricket or tennis, so 60 - 35 = 25 students play neither sport .
Determining the locus of a complex number z satisfying an equation such as |z + 1| = 1 involves recognizing it represents a geometric shape. This specific form implies z lies on a circle with center at (-1,0) and radius 1. Graphically, this locus represents all complex numbers equidistant from a fixed point, translating the algebraic equation into a geometric construct (a circle in this case).
To determine the number of subsets of a finite set with elements, we use the formula 2^n, where n is the number of elements in the set. Given two finite sets with m and n elements respectively, the difference in the total number of subsets is calculated by 2^m - 2^n. If it's given that the total number of subsets of the first set is 56 more than those of the second set, we have the equation 2^m = 2^n + 56. Solving this equation helps us find the values of m and n. For instance, the correct pair satisfying the condition 2^m = 2^n + 56 is (7, 6).
In an arithmetic progression, each term is determined by the first term and the common difference. If the p-th term is q and the (p + q)-th term is 0, we use the AP formula for the nth term: a_n = a_1 + (n-1)d, where a_1 is the first term and d the common difference. Solving the two given conditions simultaneously helps determine the common difference and specific terms. For example, the q-th term in this AP will be -p if conditions are adjusted and solved properly, indicating how the terms progress with respect to p and q .
Logical conditions like 'no two vowels are adjacent' affect how we calculate permutations by introducing constraints. Solving these involves initial arrangements of consonants as a base, setting restricted slots for vowels. For 'EAMCOT' with three vowels, position consonants first = 3! ways, and place vowels in remaining gaps such that they are not adjacent = Ways = (4 slots) P (3 positions for vowels). This logic is applied to ensure distinct permutations given logical constraints .
When analyzing expansions using recurrence relations, such as finding the total number of terms in (x + a)^51 − (x − a)^51, we consider the symmetry and pattern of contributions from binomial expansions. Odd terms cancel, and exploring this cancellation yields insight into which terms persist. For the expansion given, after simplification through cancellation of middle terms, 26 terms remain. Recursively, this reflects a deeper understanding of algebraic symmetry within polynomial expansions .
