Rankbit System
JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%) | JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%)

Let A=[a_ij] be a square matrix of order 2 with entries either 0 or 1. Let E be the event that A is an invertible matrix. Then the probability P(E) is: [cite: 3338, 3339]

Solution & Explanation

### Related Formula A 2 times 2 matrix A = beginpmatrix a & b \\ c & d endpmatrix is invertible if and only if its determinant is non-zero: det(A) = ad - bc neq 0 ### Step 1: Count Total Matrix Sample Space Each of the 4 entry slots in the 2 times 2 matrix has 2 binary choices (0 or 1) : textTotal Matrices = 2^4 = 16 ### Step 2: Count Favorable Non-Zero Determinant Matrices Since elements are 0 or 1, the products ad and bc can only evaluate to 0 or 1. For ad - bc neq 0, we have two distinct cases [cite: 4051, 4054]: - **Case I:** ad = 1 and bc = 0 . ad = 1 Rightarrow a = 1, d = 1 (1 configuration). bc = 0 Rightarrow (b, c) in \(0,0), (0,1), (1,0)\ (3 configurations). textWays = 1 times 3 = 3 text matrices - **Case II:** ad = 0 and bc = 1 . bc = 1 Rightarrow b = 1, c = 1 (1 configuration). ad = 0 Rightarrow (a, d) in \(0,0), (0,1), (1,0)\ (3 configurations). textWays = 1 times 3 = 3 text matrices textTotal Favorable Matrices = 3 + 3 = 6 ### Step 3: Calculate Probability Divide the favorable count by the total sample size : P(E) = frac616 = frac38 ### Pattern Recognition For low-order matrix configuration spaces with binary inputs, directly analyzing the product outcomes (1-0=1 or 0-1=-1) prevents long manual lists of all 16 matrices. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Mathematics: Probability Class 12 Mathematics: Matrices and Determinants

Reference Study Guides

More Probability Previous-Year Questions — Page 4

Q51 2025 Bayes Theorem
Bag B_1 contains 6 white and 4 blue balls, Bag B_2 contains 4 white and 6 blue balls, and Bag B_3 contains 5 white and 5 blue balls. One of the bags is selected at random and a ball is drawn from it. If the ball is white, then the probability, that the ball is drawn from Bag B_2, is:
  • A. frac13
  • B. frac415
  • C. frac23
  • D. frac25

Solution

### Related Formula Bayes' Theorem formula: P(E_2|A) = fracP(E_2) cdot P(A|E_2)P(E_1) cdot P(A|E_1) + P(E_2) cdot P(A|E_2) + P(E_3) cdot P(A|E_3) ### Core Logic Let the events be defined as: E_1: Bag B_1 is selected E_2: Bag B_2 is selected E_3: Bag B_3 is selected A: The drawn ball is white Since a bag is selected at random: P(E_1) = P(E_2) = P(E_3) = frac13 Conditional probabilities of drawing a white ball from each bag: P(A|E_1) = frac610, quad P(A|E_2) = frac410, quad P(A|E_3) = frac510 ### Step 1: Substitute and Calculate Substituting the values into Bayes' theorem: P(E_2|A) = fracfrac13 times frac410frac13 times frac610 + frac13 times frac410 + frac13 times frac510 P(E_2|A) = frac46 + 4 + 5 = frac415 ### Pattern Recognition When bags have equal selection probability, the required conditional probability is simply the number of favorable white balls divided by the total number of white balls across all bags: 4 / (6 + 4 + 5) = 4/15. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Mathematics: Probability
Q56 2025 Classical Definition of Probability
Let S be the set of all the words that can be formed by arranging all the letters of the word GARDEN. From the set S, one word is selected at random. The probability that the selected word will NOT have vowels in alphabetical order is:
  • A. frac14
  • B. frac23
  • C. frac13
  • D. frac12

Solution

### Related Formula Probability of an event P(E') = 1 - P(E), where E is the complementary event. ### Core Logic The word GARDEN contains 6 distinct letters: G, A, R, D, E, N. Total number of permutations (words in set S) = 6! = 720. The vowels present are A and E. In any random arrangement of these letters, there are only 2 possible mutual relative arrangements for the vowels: 1) A appears before E (alphabetical order) 2) E appears before A By symmetry, both relative arrangements are equally probable. ### Step 1: Calculate Probabilities Probability that vowels are in alphabetical order = frac12. Therefore, the probability that the selected word will NOT have vowels in alphabetical order is: 1 - frac12 = frac12 ### Pattern Recognition Symmetry Shortcut: For any k distinct specific objects inside an arrangement of distinct items, the number of ways they can be sorted in a unique relative order is exactly 1/k! of the total arrangements. Here k=2 vowels, so probability of alphabetical order is 1/2! = 1/2. Not alphabetical is 1 - 1/2 = 1/2. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 11 Mathematics: Permutations and Combinations Class 12 Mathematics: Probability

More Probability Questions — jee_main_2025_24_jan_evening

Practice all Probability previous-year questions →

YOUR FIRST PREP STEP STARTS HERE

We Map Every Repeating Question in Competitive Exams.

Say goodbye to generic mock test fatigue. RankBit uses smart analysis to group past exam questions into their foundational Repeating Question Types. Find chapter weightage, track repeating questions, and score higher with targeted practice.

Select Your Target Exam

Choose an exam track below to find formulas per chapter and patterns.

Syncing Exam Intelligence

Mapping formulas and patterns across all tracks…

PATH A — FULL LENGTH PRACTICE

Full Mock Test Hub

Simulate real NTA exam conditions with fully tracked mocks. Time yourself against past papers.

Under Development
PATH B — TARGETED PRACTICE

Topic-wise Practice Hub

Practice past-year questions one chapter at a time. Pick an exam → subject → chapter and get every PYQ for that topic — pulled together from all past papers — with the chapter's key formulas alongside.

Loading Questions... Browse Topics
Latest from the Blog
View all →

Loading articles...