5ⁿ − 1 is divisible by 4 for all positive integers n.
- ATrue
- BFalse
5 ≡ 1 (mod 4), so 5ⁿ − 1 ≡ 0 (mod 4); it can also be proved by induction.5 ≡ 1 (mod 4), isliye 5ⁿ − 1 ≡ 0 (mod 4); induction se bhi prove hota hai.
Syllabus: lectures 23–45. Past-paper MCQs are shown first.Syllabus: lecture 23–45. Past paper ki MCQs pehle dikhai gayi hain.
30 MCQs · 8 short · 3 long questions · 30 MCQs from past papers30 MCQs · 8 short · 3 long sawal · 30 MCQs past papers se
5ⁿ − 1 is divisible by 4 for all positive integers n.
5 ≡ 1 (mod 4), so 5ⁿ − 1 ≡ 0 (mod 4); it can also be proved by induction.5 ≡ 1 (mod 4), isliye 5ⁿ − 1 ≡ 0 (mod 4); induction se bhi prove hota hai.
"If 5k is even, then 5k + 5k + 5k is odd."
5k + 5k + 5k = 3(5k), and 3 times an even number is even.5k + 5k + 5k = 3(5k), aur even ka 3 guna even hi hota hai.
"The square root of every prime number is irrational."
√p for a prime p cannot be a ratio of integers (proof by contradiction).Prime p ka √p integers ka ratio nahi ho sakta (proof by contradiction).
If a and b are positive integers and a = b·q + r with q and r non-negative integers, then
This is the step used in the Euclidean algorithm.Euclidean algorithm isi step par chalta hai.
The greatest common divisor of 27 and 72 is
27 = 3³ and 72 = 2³·3², so gcd = 3² = 9.27 = 3³ aur 72 = 2³·3², isliye gcd = 3² = 9.
Quotient–remainder theorem: for any integer n and positive integer d, there are unique integers q and r with n = d·q + r and
The remainder is at least 0 and less than the divisor.Remainder 0 ya us se zyada aur divisor se kam hota hai.
The number of ways to select five letters from the English alphabet is
Choose 5 of 26 letters without order: C(26, 5).26 mein se 5 letters bina tarteeb ke: C(26, 5).
The number of ways to select five players from a 10-member tennis team is
Order does not matter: C(10, 5).Tarteeb ka farq nahi: C(10, 5).
If order does not matter and repetition is allowed, the number of ways to select k items from n is
Selections with repetition: C(n + k − 1, k).Repetition ke saath selection: C(n + k − 1, k).
If A and B are finite overlapping sets, which of the following must be true?
Inclusion–exclusion: subtract the overlap counted twice.Inclusion–exclusion: do baar gina gaya overlap ghata dein.
Of 200 people, 150 swim or jog or both. If 85 swim and 60 swim and jog, how many jog?
150 = 85 + J − 60, so J = 125.150 = 85 + J − 60, isliye J = 125.
A tree diagram lists all logical possibilities of a sequence of events, each with finitely many outcomes.
That is exactly what a tree diagram shows.Tree diagram yahi dikhata hai.
Two dice are thrown. The probability that the total is 5 or 11 is
Sum 5 in 4 ways and 11 in 2 ways: 6/36 = 1/6.Sum 5 chaar tareeqon se aur 11 do tareeqon se: 6/36 = 1/6.
A die is thrown twice. The probability that the sum of the dots is 3 or 11 is
(1,2), (2,1), (5,6), (6,5): 4/36 = 1/9.(1,2), (2,1), (5,6), (6,5): 4/36 = 1/9.
A die is thrown. The probability that the top face shows a prime or an odd number is
Prime or odd: {1, 2, 3, 5}, so 4/6 = 2/3.Prime ya odd: {1, 2, 3, 5}, isliye 4/6 = 2/3.
P(A ∪ B ∪ C) is equal to
Inclusion–exclusion for three events.Teen events ke liye inclusion–exclusion.
If P(A ∩ B) ≠ P(A)·P(B), then the events A and B are called
Events are independent only when P(A ∩ B) = P(A)·P(B).Events sirf tab independent hain jab P(A ∩ B) = P(A)·P(B).
If P(A ∩ B) = P(A)·P(B), then the events A and B are called
This product rule is the definition of independent events.Ye product rule independent events ki definition hai.
A rule that assigns a numerical value to each outcome in a sample space is called a
That is the definition of a random variable.Ye random variable ki definition hai.
Two distinct edges with the same set of end points are called
Edges with the same end points are parallel edges.Ek jaise end points wale edges parallel edges hain.
A walk that starts and ends at the same vertex is called a
Same start and end vertex makes a walk closed.Shuru aur aakhir ka vertex ek ho to walk closed hoti hai.
A circuit that consists of a single vertex is called
A one-vertex circuit is the trivial circuit.Ek vertex wala circuit trivial circuit hai.
The crossing number of a planar graph is
A planar graph can be drawn with no edges crossing.Planar graph ko bina edges cross kiye banaya ja sakta hai.
In a tree, a vertex of degree greater than 1 is called a
Degree 1 vertices are terminal (leaves); higher degree vertices are branch (internal) vertices.Degree 1 wale vertices terminal hain; is se zyada degree wale branch vertices.
Any two spanning trees of a connected graph
A spanning tree on n vertices always has n − 1 edges.n vertices wale spanning tree mein hamesha n − 1 edges hote hain.
(n + 1)!/(n − 1)! =
(n + 1)!/(n − 1)! = (n + 1)·n = n² + n.(n + 1)!/(n − 1)! = (n + 1)·n = n² + n.
The product of the positive integers from 1 to n is called
1 × 2 × … × n = n!.1 × 2 × … × n = n!.
The value of (−2)! is
Factorial is defined only for non-negative integers.Factorial sirf non-negative integers ke liye defined hai.
An integer n is a perfect square if and only if n = k² for some integer k.
This is the definition of a perfect square.Ye perfect square ki definition hai.
The value of 0! is
By definition 0! = 1.Definition ke mutabiq 0! = 1.
No MCQs match this filter.Is filter mein koi MCQ nahi.
A connected planar simple graph has 15 edges, and its plane drawing has 7 faces. How many vertices does it have?
Euler's formula: v − e + f = 2. So v − 15 + 7 = 2, which gives v = 10.
How many ordered selections of two elements can be made from the set {0, 1, 2, 3}?
Order matters, so use permutations: P(4, 2) = 4!/(4 − 2)! = 4 × 3 = 12.
Let A and B be events. Write the event "only A occurs" in set notation.
Only A occurs means A happens and B does not: A ∩ Bᶜ (also written A − B).
A family has exactly two children. Let A = "the children are of both sexes" and B = "there is at most one boy". Show that A and B are dependent events.
Sample space S = {BB, BG, GB, GG}, all equally likely. A = {BG, GB}, so P(A) = 2/4 = 1/2. B = {BG, GB, GG}, so P(B) = 3/4. A ∩ B = {BG, GB}, so P(A ∩ B) = 1/2. Since P(A)·P(B) = 3/8 ≠ 1/2 = P(A ∩ B), A and B are dependent.
A cafeteria offers 2 soups, 5 sandwiches, 3 desserts and 3 drinks. How many different lunches are possible if a lunch has one soup, one sandwich, one dessert and one drink?
By the product rule: 2 × 5 × 3 × 3 = 90 lunches.
Use mathematical induction to prove that 1 + 2 + 3 + … + n = n(n + 1)/2 for all integers n ≥ 1.
Basis (n = 1): 1 = 1(2)/2. True. Inductive step: assume 1 + 2 + … + k = k(k + 1)/2. Then 1 + 2 + … + k + (k + 1) = k(k + 1)/2 + (k + 1) = (k + 1)(k + 2)/2, which is the formula for k + 1. Hence it holds for all n ≥ 1.
Let A and B be events with P(B) = 3/4 and P(A ∩ B) = 2/7. Find P(A | B).
P(A | B) = P(A ∩ B)/P(B) = (2/7)/(3/4) = 8/21.
How many 11-bit strings contain exactly five 0s?
Choose the 5 positions for the 0s out of 11: C(11, 5) = 462.
A box contains 15 items: 4 defective and 11 good. Two items are selected one after the other without replacement. Find the probability that the first is good and the second is defective.
P(first good) = 11/15. After that, 14 items remain and 4 are defective, so P(second defective | first good) = 4/14. P = 11/15 × 4/14 = 44/210 = 22/105 ≈ 0.21.
Find n if P(n, 2) = 72.
P(n, 2) = n(n − 1) = 72, so n² − n − 72 = 0, i.e. (n − 9)(n + 8) = 0. n = 9 or n = −8. Since n must be a positive integer, n = 9. Check: 9 × 8 = 72.
Use mathematical induction to prove that 1 + 3 + 5 + … + (2n − 1) = n² for all integers n ≥ 1.
Basis (n = 1): left side = 1, right side = 1² = 1. True. Inductive step: assume 1 + 3 + … + (2k − 1) = k² for some k ≥ 1. Then 1 + 3 + … + (2k − 1) + (2(k + 1) − 1) = k² + (2k + 1) = (k + 1)². So the formula holds for k + 1. By induction it is true for all n ≥ 1.