Sets and Probability | B.Stat Objective Problems

Try this problem from I.S.I. B.Stat Entrance Objective Problem from TOMATO based on Sets and Probability. You may use sequential hints to solve the problem.

Sets and Probability (B.Stat Objective problems)


Sixty students appeared in a test consisting of three papers I ,II, and III. Of these students, 25 passed in paper I, 20 in paper II and 8 in paper III. Further 42 students passed in at least one of papers I and II, 30 in at least one of papers I and III, 25 in at least one of papers II and III. Only one student passed in all the three papers. Then the number of students who failed in all the three papers is

  • 17
  • 15
  • 45
  • 33

Key Concepts


Sets

Probability

Algebra

Check the Answer


Answer: 15

B.Stat Objective Problem

Challenges and Thrills of Pre-College Mathematics by University Press

Try with Hints


Let failed P I=P(A)=35, p II=P(B)=40, p III =P(C)=52, P (IandII)=\(P(A \bigcap B)\)= 18 P (I and III)=\(P(A \bigcap C)\)=30 P (II and III)=\(P(B \bigcap C)\)=35 P (I or II or III)=\(P(A \bigcup B \bigcup C)\)=59

Then by Poincare Theorem, \(P(A \bigcup B \bigcup C)\)=P(A)+P(B)+P(C)-\(P(A \bigcap B)\)-\(P(A \bigcap C)\)-\(P(B \bigcap C)\)+x

Then 59=35+40+52-18-30-35+x where x is the required value

then x=59-44=15.

Subscribe to Cheenta at Youtube


Problem on Fibonacci sequence | AIME I, 1988 | Question 13

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1988 based on Fibonacci sequence.

Fibonacci sequence Problem - AIME I, 1988


Find a if a and b are integers such that \(x^{2}-x-1\) is a factor of \(ax^{17}+bx^{16}+1\).

  • is 107
  • is 987
  • is 840
  • cannot be determined from the given information

Key Concepts


Integers

Digits

Sets

Check the Answer


Answer: is 987.

AIME I, 1988, Question 13

Elementary Number Theory by David Burton

Try with Hints


Let F(x)=\(ax^{17}+bx^{16}+1\)

Let P(x) be polynomial such that

\(P(x)(x^{2}-x-1)=F(x)\)

constant term of P(x) =(-1)

now \((x^{2}-x-1)(c_1x^{15}+c_2x^{14}+....+c_{15}x-1)\) where \(c_{i}\)=coefficient

comparing the coefficients of x we get the terms

since F(x) has no x term, then \(c_{15}\)=1

getting \(c_{14}\)

\((x^{2}-x-1)(c_1x^{15}+c_2x^{14}+....+c_{15}x-1)\)

=terms +\(0x^{2}\) +terms

or, \(c_{14}=-2\)

proceeding in the same way \(c_{13}=3\), \(c_{12}=-5\), \(c_{11}=8\) gives a pattern of Fibonacci sequence

or, coefficients of P(x) are Fibonacci sequence with alternating signs

or, a=\(c_1=F_{16}\) where \(F_{16}\) is 16th Fibonacci number

or, a=987.

Subscribe to Cheenta at Youtube


Digits and Integers | AIME I, 1990 | Question 13

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1990 based on Digits and Integers.

Digits and Integers - AIME I, 1990


Let T={\(9^{k}\): k is an integer, \(0 \leq k \leq 4000\)} given that \(9^{4000}\) has 3817 digits and that its first (leftmost) digit is 9, how many elements of T have 9 as their leftmost digit?

  • is 107
  • is 184
  • is 840
  • cannot be determined from the given information

Key Concepts


Integers

Digits

Sets

Check the Answer


Answer: is 184.

AIME I, 1990, Question 13

Elementary Number Theory by David Burton

Try with Hints


here \(9^{4000}\) has 3816 digits more than 9,

or, 4000-3816=184

or, 184 numbers have 9 as their leftmost digits.

Subscribe to Cheenta at Youtube


Complex numbers and Sets | AIME I, 1990 | Question 10

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1990 based on Complex Numbers and Sets.

Complex Numbers and Sets - AIME I, 1990


The sets A={z:\(z^{18}=1\)} and B={w:\(w^{48}=1\)} are both sets of complex roots with unity, the set C={zw: \(z \in A and w \in B\)} is also a set of complex roots of unity. How many distinct elements are in C?.

  • is 107
  • is 144
  • is 840
  • cannot be determined from the given information

Key Concepts


Integers

Complex Numbers

Sets

Check the Answer


Answer: is 144.

AIME I, 1990, Question 10

Complex Numbers from A to Z by Titu Andreescue

Try with Hints


18th and 48th roots of 1 found by de Moivre's Theorem

=\(cis(\frac{2k_1\pi}{18})\) and \(cis(\frac{2k_2\pi}{48})\)

where \(k_1\), \(K_2\) are integers from 0 to 17 and 0 to 47 and \(cis \theta = cos \theta +i sin \theta\)

zw= \(cis(\frac{k_1\pi}{9}+\frac{k_2\pi}{24})=cis(\frac{8k_1\pi+3k_2\pi}{72})\)

and since the trigonometric functions are periodic every period \({2\pi}\)

or, at (72)(2)=144 distinct elements in C.

Subscribe to Cheenta at Youtube


Rearrangement Problem | PRMO 2019 | Question 27

Try this beautiful problem from the Pre-RMO, 2019 based on rearrangement.

Rearrangement Problem - PRMO 2019


We will say that the rearrangement of the letters of a word has no fixed letters if. When the rearrangement is placed directly below the word, no column has the same letter repeated. For instance, HBRATA is a rearrangement with no fixed letters of BHARAT. How many distinguishable rearrangements with no fixed letters do BHARAT have? (The two A's are considered identical).

  • is 107
  • is 84
  • is 840
  • cannot be determined from the given information

Key Concepts


Arrangement

Sets

Integer

Check the Answer


Answer: is 84.

PRMO, 2019, Question 27

Principles and Techniques in Combinatorics by Chi Chuan

Try with Hints


Let us assume 2 A's as \(A_1\) and \(A_2\) \(BHA_1RA_2T\)

Numbers of rearrangement of these 6=6!\((\frac{1}{2!}-\frac{1}{3!}+\frac{1}{4!}-\frac{1}{5!}+\frac{1}{6!})\)=265

Let P be a set when \(A_2\) occupies \(A_1)\)

and Q be a set when \(A_1\) occupies \(A_2\)

n(P)=n(Q)=53

\(n(P \cap Q)=9\)

So, required arrangements

=\(\frac{1}{2}[265-n(P \cup Q)]\)=84.

Subscribe to Cheenta at Youtube


Sets and Integers | TOMATO B.Stat Objective 121

Try this problem from I.S.I. B.Stat Entrance Objective Problem based on Sets and Integers.

Sets and Integers ( B.Stat Objective Question )


For each positive integer n consider the set \(S_n\) defined as follows \(S_1\)={1}, \(S_2\)={2,3}, \(S_3\)={4,5,6}, ..., and , in general, \(S_{n+1}\) consists of n+1 consecutive integers the smallest of which is one more than the largest integer in \(S_{n}\). Then the sum of all the integers in \(S_{21}\) equals

  • 1113
  • 4641
  • 53361
  • 5082

Key Concepts


Sets

Integers

Sum

Check the Answer


Answer: 4641.

B.Stat Objective Problem 121

Challenges and Thrills of Pre-College Mathematics by University Press

Try with Hints


\(S_1\) has 1 element

\(S_2\) has 2 element

.....

\(S_{20}\) has 20 element

So number of numbers covered=1+2+3+...+20

sum =\(\frac{(20)(21)}{2}\)=210

\(S_{21}\) has 21 elements with first element= 211

sum of n terms of a.p series with common difference d,

\(sum=\frac{n}{2}[2a+(n-1)d]\)

Then in our given question no of terms n=21 and c.d =1

Then the sum of elements=\(\frac{21}{2}[(2)(211)+(20)(1)]\)=4641.

Subscribe to Cheenta at Youtube


Venny Venny AMy GMy | ISI MStat 2016 PSB Problem 3

This problem is a very basic and cute application of set theory, Venn diagram and AM GM inequality to solve the ISI MStat 2016 PSB Problem 3.

Problem - Venn diagram and AM GM inequality

For any two events \(A\) and \(B\), show that
$$
(\mathrm{P}(A \cap B))^{2}+\left(\mathrm{P}\left(A \cap B^{c}\right)\right)^{2}+\left(\mathrm{P}\left(A^{c} \cap B\right)\right)^{2}+\left(\mathrm{P}\left(A^{c} \cap B^{c}\right)\right)^{2} \geq \frac{1}{4}
$$

Prerequisites

Solution

Draw the Venn Diagram

venn diagram and am gm inequality problem

P(region Red) = \(Y\)

P(region Blue) = \(Z\)

P(region Grey) = \(W\)

P(region Brown) = \(X\)

Observe that \( W + X + Y + Z = 1\). \( W, X, Y, Z \geq 0\).

Now, Calculate Given Probability of Sets in terms of \( W, X, Y, Z \).

\({P}(A \cap B) = Z\).

\({P}\left(A \cap B^{c}\right) = Y\).

\({P}\left(A^{c} \cap B\right) = W\).

\( {P}\left(A^{c} \cap B^{c}\right) = X\).

The Final Inequality

\( W, X, Y, Z \geq 0\).

\( W + X + Y + Z = 1\).

Observe that \( 3(W^2 + X^2 + Y^2 + Z^2) = (W^2+X^2) + (W^2+Y^2) + (W^2+Z^2) + (X^2+Y^2) + (X^2+Z^2) + (Y^2+Z^2)\).

\( 3(W^2 + X^2 + Y^2 + Z^2) \geq 2WX + 2WY + 2WZ + 2XY + 2XZ + 2YZ \) by AM - GM Inequality.

\( \Rightarrow 4(W^2 + X^2 + Y^2 + Z^2) \geq (W + X + Y + Z)^2 = 1\).

\( \Rightarrow (W^2 + X^2 + Y^2 + Z^2) \geq \frac{1}{4} \).

Hence,

$$
(\mathrm{P}(A \cap B))^{2}+\left(\mathrm{P}\left(A \cap B^{c}\right)\right)^{2}+\left(\mathrm{P}\left(A^{c} \cap B\right)\right)^{2}+\left(\mathrm{P}\left(A^{c} \cap B^{c}\right)\right)^{2} \geq \frac{1}{4}
$$

Sets and Venn diagrams |B.Math Entrance

Try this beautiful problem from B.Math Entrance Exam based on Sets and Venn diagrams.

Sets and Venn diagrams - B.Math Entrance


In a village of 1000 inhabitants, there are three newspapers P, Q,and R in circulation. Each of these papers is read by 500 persons. Papers P and Q are read by 250 persons, papers Q and R are read by 250 persons, papers R and P are read by 250 persons.All the three papers are read by 250 persons. Then the number of persons who read no newspaper at all

  • is 500
  • is 250
  • is 0
  • cannot be determined from the given information

Key Concepts


Sets

Venn diagrams

Algebra

Check the Answer


Answer: is 0.

B. Math Entrance, India

Test of Mathematics at 10+2 Level by East West Press

Try with Hints


Here n(P)=500, n(Q)=500, n(R)=500, n(PQ)=250, n(QR)=250, n(RP)=250, n(PQR)=250

n(P+Q+R)=n(P)+n(Q)+n(R)-n(PQ)-n(QR)-n(RP)+n(PQR)

n(P+Q+R)=1000 Then P,Q and R read by 1000 inhabitantsand the number of persons who read no newspaper at all is 0.

Subscribe to Cheenta at Youtube