Zadanie 6
A field photographer packs 2 distinct lenses from 6 available and 3 distinct filters from 5 available. Two particular filters must not be packed together. How many different kits can be assembled?
Count selections and ordered arrangements, and expand binomials with rational powers within the required validity interval.
Tę umiejętność sprawdza 41 zadań wzorowanych na arkuszach IB z lat 2022–2026.
A field photographer packs 2 distinct lenses from 6 available and 3 distinct filters from 5 available. Two particular filters must not be packed together. How many different kits can be assembled?
How many arrangements have no two silver objects adjacent?
Require that no two silver objects are adjacent. How many arrangements additionally have silver objects at both ends?
Show that the binomial expansion through x² is −7/4 + (17/16)x − (37/64)x2.
The first two nonzero Maclaurin terms of x/(a + bx) match those in 12c, where a,b are rational. Find a,b.
Show that , explaining the probability calculation for every coefficient.
In the binomial expansion about x = 0 of , where q is a positive rational number, the coefficient of x6 is 320. Find q.
A calibration network contains n sensors. Each unordered pair is scheduled to exchange three test messages. One sensor is removed after participating in exactly eight messages; all pairs among the remaining sensors complete their three messages. In total 701…
Find the first four terms of the binomial expansion of F(x) in ascending powers of x.
Expand R(x) in ascending powers of x through x2.
The first three terms of these expansions agree. Prove that q = 2.
Using p = 4, q = 2, the rational expression approximates F(x) near zero, with ∣x∣ < 1/6. (i) Choose a suitable x and use this approximation to estimate as a fraction of integers. (ii) Explain why the same approximation is less accurate for…
How many different divisions of the samples into three groups are possible?
A field team has 12 specialists. Select an eight-person deployment group with three distinct roles: navigation lead, equipment lead and communications lead; the other five members have no assigned roles. How many selections are possible?
(i) Show that a=3. (ii) Find b.
How many run lists can be made with no restrictions?
How many run lists keep all jobs of each test type consecutive?
Three jobs of a single test type are chosen for a pilot; their order is irrelevant. How many selections are possible?
(i) Show that the first four terms of (1 + 3x2)−1 are 1 − 3x2 + 9x4 − 27x6, for . (ii) Hence approximate its indefinite integral through the x⁷ term.
(i) Expand (1 − 2x2)−1/2 through x⁴. (ii) Hence give the polynomial approximation to H(x) through x⁵.
Using mathematical induction and , prove for every integer n≥2.
How many seating assignments satisfy this condition?
Researchers C and D must also be nonadjacent, while A,B remain adjacent. Find the number of assignments.
Express the number of assignments in terms of n.
Two named engineers must now work in different crews. The number of permitted assignments becomes 8/15 of the original number. Find n.
How many assignments are possible if the four probes must not form one adjacent block?
Two additional distinct probes E,F are now installed. A,B,C,D must occupy an adjacent block of four. How many assignments of all six probes are possible?
Conjecture A_n in terms of n.
Three distinct labels are chosen from {1, 2, …, 32}. Count the unordered selections whose label sum leaves remainder 1 on division by 3.
Twelve trial outcomes are placed in the twelve numbered circular slots. If exactly three are successes, how many placements have all three success slots consecutive around the circle?
Consider n≥4 trials with exactly three successes, placed in n numbered circular slots in trial order. (i) Give the number of placements in which all three success slots are consecutive around the circle. (ii) Find the greatest n for which the conditional…
For experiment B, express P(B) in terms of y.
Count linear arrangements when (i) there are no restrictions; (ii) all four metal pieces are consecutive.
Count selections of five pieces containing at least three metal pieces.
Count linear arrangements when (i) there are no restrictions; (ii) all four metal pieces are consecutive.
Count selections of five pieces containing at least three metal pieces.
Initially all five containers must occupy consecutive slots. Count the arrangements.
They are rearranged with at least one empty slot between F and every other container. The other four need not be consecutive or separated from one another. Count the arrangements.
How many codes have all digits distinct?
How many have distinct digits in increasing order?
Count the codes (i) if symbols may repeat; (ii) if all three symbols must differ.
Zapisujemy na Twoim urządzeniu to, bez czego serwis nie działa, np. zalogowanie. Plików analitycznych użyjemy tylko za Twoją zgodą. Szczegóły w polityce prywatności.