Study guide
12.2 Basic Statistics, Permutations, Combinations & Probability
NTS Graduate Assessment Test GAT General
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: GAT General Overview & Test Administration
1.1 GAT General Test Structure & Logistics 1.2 Time Management & No-Negative-Marking Strategy 1.3 GAT Test Categories & Admissions Alignment
2 Chapter 2: Verbal Reasoning — Vocabulary, Analogies & Word Roots
2.1 Verbal Analogies & Relationship Mapping 2.2 Synonyms, Antonyms & Contextual Meaning 2.3 High-Frequency NTS Vocabulary & Word Roots
3 Chapter 3: Verbal Reasoning — Sentence Completion & Reading Comprehension
3.1 Sentence Completion & Single/Double-Blank Strategies 3.2 Reading Comprehension & Textual Analysis 3.3 Essential English Grammar & Sentence Structure
4 Chapter 4: Verbal Reasoning — Grammar: Tenses, Structure & Conditionals
4.1 Tenses & Aspects I: Simple and Progressive Forms 4.2 Tenses & Aspects II: Perfect Forms, Sequence of Tenses & Voice 4.3 Parts of Speech in Depth: Articles, Prepositions & Determiners 4.4 Conditional Sentences & Hypothetical Structures
5 Chapter 5: Verbal Reasoning — Language Functions & Passage Analysis
5.1 Language Functions & Situational Appropriacy 5.2 Linking Devices, Transitions & Textual Cohesion 5.3 Main Idea, Title Selection & Topic Sentences 5.4 Types of Passage, Author's Purpose & Tone
6 Chapter 6: Quantitative Reasoning — Arithmetic & Number Theory
6.1 Number Properties, Divisibility Rules & Prime Factorization 6.2 Fractions, Decimals, Percentages & Profit-Loss Math 6.3 Ratios, Proportions, Mixtures & Work-Time Rates
7 Chapter 7: Quantitative Reasoning — Business, Consumer & Islamic Financial Mathematics
7.1 Business, Financial & Consumer Mathematics 7.2 Zakat, Ushar & Inheritance Calculations
8 Chapter 8: Quantitative Reasoning — Algebra & Equations
8.1 Algebraic Simplification, Exponent Rules & Radicals 8.2 Linear Equations, Systems & Quadratic Equations 8.3 Inequalities, Absolute Value & Function Basics
9 Chapter 9: Quantitative Reasoning — Matrices, Sequences, Sets & Functions
9.1 Matrices & Determinants 9.2 Arithmetic & Geometric Sequences 9.3 Sets, Venn Relations & Functions
10 Chapter 10: Quantitative Reasoning — Geometry & Measurement
10.1 Lines, Angles, Triangles & Pythagorean Theorem 10.2 Quadrilaterals, Polygons, Circles & Coordinate Geometry 10.3 Perimeter, Area, Surface Area & 3D Volume Calculations
11 Chapter 11: Quantitative Reasoning — Triangle Theorems, Circles & Trigonometry
11.1 Congruent Triangles, Bisectors & the Projection Rule 11.2 Circle Theorems: Chords, Tangents, Arcs & Segments 11.3 Introduction to Trigonometry
12 Chapter 12: Quantitative Reasoning — Data Interpretation & Word Problems
12.1 Data Interpretation: Tables, Bar Charts, Line Graphs & Pie Charts 12.2 Basic Statistics, Permutations, Combinations & Probability 12.3 Quantitative Word Problems & Age/Coin/Venn Diagram Scenarios
13 Chapter 13: Analytical Reasoning — Fundamentals & Ordering Games
13.1 Analytical Reasoning Framework & Diagramming Notation 13.2 Linear Sequencing, Ranking & Slot-Based Puzzles 13.3 Circular Seating Arrangements & Spatial Relative Puzzles
14 Chapter 14: Analytical Reasoning — Grouping, Selection & Matrix Games
14.1 Grouping, Distribution & Bin-Assignment Puzzles 14.2 Selection Games & Team Formation Constraints 14.3 Attribute Matching & Multi-Dimensional Grid Puzzles
15 Chapter 15: Analytical Reasoning — Critical & Deductive Logic
15.1 Logical Arguments, Premise-Conclusion Structure & Unstated Assumptions 15.2 Strengthening, Weakening & Evaluating Logical Arguments 15.3 Formal Deductions, Syllogisms & Scenario-Based Inferences
16 Chapter 16: Analytical Reasoning — Inductive Logic & Causal Inference
16.1 Inductive Logic, Generalisation & Causal Reasoning
12.2 Basic Statistics, Permutations, Combinations & Probability
Key Takeaways Explain This Topic AI
Measures of central tendency (mean, median, mode) and dispersion (range) form the foundation of statistical analysis on the NTS GAT, with the fundamental mean identity Sum = Mean * n.
Combined mean calculations apply the weighted formula x_comb = (n1 x1 + n2 x2) / (n1 + n2) to determine aggregate averages across multiple unequal groups.
Classical probability measures favorable outcomes over total outcomes, where the complementary rule P(E') = 1 - P(E) drastically simplifies 'at least one' scenarios.
The Fundamental Counting Principle states that sequential independent tasks with m and n choices yield m * n total outcomes.
Permutations (nPr = n! / (n-r)!) are required when selection order matters (e.g., specific titles/rankings), whereas combinations (nCr = n! / (r!(n-r)!)) are used when order is irrelevant (e.g., committee selection).
Last updated: August 2026
Basic Statistics, Permutations, Combinations & Probability
Statistical analysis, counting principles, and probability theory represent fundamental quantitative skills assessed on the NTS GAT General examination. Whether calculating the combined average score of student cohorts, evaluating arrangement possibilities for a panel, or determining the likelihood of compound events, mastering these mathematical frameworks provides a distinct competitive advantage. This section provides a thorough treatment of measures of central tendency, weighted statistics, combinatorics (permutations and combinations), and classical probability rules.
- 1. Statistical Measures of Central Tendency & Dispersion
- A. Arithmetic Mean (Average)
The arithmetic mean ( x ˉ \bar{x} x ˉ ) represents the central measure of a numerical dataset containing n n n elements: x ˉ = ∑ i = 1 n x i n = x 1 + x 2 + ⋯ + x n n \bar{x} = \frac{\sum_{i=1}^{n} x_i}{n} = \frac{x_1 + x_2 + \dots + x_n}{n} x ˉ = n ∑ i = 1 n x i = n x 1 + x 2 + ⋯ + x n
The Fundamental Sum Identity: Sum of Values = x ˉ × n \text{Sum of Values} = \bar{x} \times n Sum of Values = x ˉ × n . On the NTS GAT, when an additional element is added or removed from a group, always convert given means into total sums first.
B. Weighted Average and Combined Mean
When individual data groups have unequal sizes ( n 1 , n 2 , … , n k n_1, n_2, \dots, n_k n 1 , n 2 , … , n k ) or varying weights ( w 1 , w 2 , … , w k w_1, w_2, \dots, w_k w 1 , w 2 , … , w k ), calculating a simple average of the group means produces an incorrect result. The Weighted Mean ( x ˉ w \bar{x}_w x ˉ w ) and Combined Mean ( x ˉ comb \bar{x}_{\text{comb}} x ˉ comb ) must be used: x ˉ w = ∑ ( w i x i ) ∑ w i \bar{x}_w = \frac{\sum (w_i x_i)}{\sum w_i} x ˉ w = ∑ w i ∑ ( w i x i ) x ˉ comb = n 1 x ˉ 1 + n 2 x ˉ 2 + ⋯ + n k x ˉ k n 1 + n 2 + ⋯ + n k \bar{x}_{\text{comb}} = \frac{n_1 \bar{x}_1 + n_2 \bar{x}_2 + \dots + n_k \bar{x}_k}{n_1 + n_2 + \dots + n_k} x ˉ comb = n 1 + n 2 + ⋯ + n k n 1 x ˉ 1 + n 2 x ˉ 2 + ⋯ + n k x ˉ k
C. Median
The median is the middle observation in an ordered dataset arranged in ascending or descending sequence.
Odd Number of Observations ( n n n ): The median is the single value located at position n + 1 2 \frac{n+1}{2} 2 n + 1 .
Even Number of Observations ( n n n ): The median is the arithmetic average of the two middle values located at positions n 2 \frac{n}{2} 2 n and n 2 + 1 \frac{n}{2} + 1 2 n + 1 .
Property: The median is resistant to extreme outliers, whereas the mean is sensitive to extreme values.
D. Mode and Range
Mode: The data value occurring with the highest frequency. A dataset may be unimodal (one mode), bimodal (two modes), multimodal, or have no mode (if all values occur with equal frequency).
Range: A basic measure of dispersion calculated as the difference between the maximum and minimum observations: Range = x max − x min \text{Range} = x_{\text{max}} - x_{\text{min}} Range = x max − x min .
2. Fundamentals of Combinatorics: Permutations & Combinations
Combinatorics provides counting techniques to calculate the total number of possible arrangements or selections without manually listing every outcome.
A. Fundamental Counting Principle
If a primary operation can be performed in m m m distinct ways, and a secondary independent operation can be performed in n n n distinct ways, then both operations in sequence can be performed in m × n m \times n m × n total ways.
B. Factorial Notation
For any positive integer n n n : n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 2 × 1 n! = n \times (n-1) \times (n-2) \times \dots \times 2 \times 1 n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 2 × 1
(By mathematical convention, 0 ! = 1 0! = 1 0 ! = 1 ).
C. Permutations ( n P r nPr n P r ) — Order Matters
A permutation is an ordered arrangement of r r r elements chosen from a set of n n n distinct elements. Use permutations when positions, titles, sequences, or ranks are distinct: n P r = n ! ( n − r ) ! nPr = \frac{n!}{(n-r)!} n P r = ( n − r )! n !
Permutations with Repetition: The number of distinct arrangements of n n n items where p p p items are identical of type 1, q q q items are identical of type 2, etc., is: Arrangements = n ! p ! × q ! × r ! \text{Arrangements} = \frac{n!}{p! \times q! \times r!} Arrangements = p ! × q ! × r ! n !
D. Combinations ( n C r nCr n C r ) — Order Does Not Matter
A combination is a selection of r r r elements chosen from a set of n n n distinct elements where the order of selection is irrelevant (e.g., forming a committee, selecting a team): n C r = n ! r ! ( n − r ) ! = n P r r ! nCr = \frac{n!}{r!(n-r)!} = \frac{nPr}{r!} n C r = r ! ( n − r )! n ! = r ! n P r
Key Symmetry Property: n C r = n C ( n − r ) nCr = nC(n-r) n C r = n C ( n − r ) (e.g., 10 C 7 = 10 C 3 = 10 × 9 × 8 3 × 2 × 1 = 120 10C7 = 10C3 = \frac{10 \times 9 \times 8}{3 \times 2 \times 1} = 120 10 C 7 = 10 C 3 = 3 × 2 × 1 10 × 9 × 8 = 120 ).
3. Probability Theory & Rules of Events
Probability measures the mathematical likelihood of an event E E E occurring within a sample space S S S containing all possible equally likely outcomes: P ( E ) = Number of Favorable Outcomes n ( E ) Total Number of Possible Outcomes n ( S ) P(E) = \frac{\text{Number of Favorable Outcomes } n(E)}{\text{Total Number of Possible Outcomes } n(S)} P ( E ) = Total Number of Possible Outcomes n ( S ) Number of Favorable Outcomes n ( E )
Probability Range: 0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1 .
A. Complementary Probability Rule
The probability that event E E E does not occur ( E ′ E' E ′ ) is: P ( E ′ ) = 1 − P ( E ) P(E') = 1 - P(E) P ( E ′ ) = 1 − P ( E )
GAT Exam Shortcut ("At Least One" Rule): When asked to calculate the probability of getting "at least one" successful outcome across multiple trials, calculate the complement (getting zero successes) and subtract from 1: P ( At least 1 Success ) = 1 − P ( Zero Successes ) P(\text{At least 1 Success}) = 1 - P(\text{Zero Successes}) P ( At least 1 Success ) = 1 − P ( Zero Successes )
B. Addition Rule for Mutually Exclusive and Non-Exclusive Events
Mutually Exclusive Events: Events A A A and B B B cannot happen simultaneously ( P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 ). P ( A or B ) = P ( A ∪ B ) = P ( A ) + P ( B ) P(A \text{ or } B) = P(A \cup B) = P(A) + P(B) P ( A or B ) = P ( A ∪ B ) = P ( A ) + P ( B )
Non-Mutually Exclusive Events: Events A A A and B B B can overlap. P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )
C. Multiplication Rule for Independent Events
Two events A A A and B B B are independent if the occurrence of one does not alter the probability of the other: P ( A and B ) = P ( A ∩ B ) = P ( A ) × P ( B ) P(A \text{ and } B) = P(A \cap B) = P(A) \times P(B) P ( A and B ) = P ( A ∩ B ) = P ( A ) × P ( B )
- 4. Step-by-Step Worked Mathematical Examples
- Worked Example 1: Combined Mean Calculation
Scenario: A GAT preparation class consists of three sections. Section A has 20 students with an average score of 75. Section B has 30 students with an average score of 85. Section C has 50 students with an average score of 90.
Question: What is the combined mean score for all 100 students across the three sections?
Step 1: Calculate total sum of marks for Section A: Sum A = 20 × 75 = 1 , 500 \text{Sum}_A = 20 \times 75 = 1,500 Sum A = 20 × 75 = 1 , 500 .
Step 2: Calculate total sum of marks for Section B: Sum B = 30 × 85 = 2 , 550 \text{Sum}_B = 30 \times 85 = 2,550 Sum B = 30 × 85 = 2 , 550 .
Step 3: Calculate total sum of marks for Section C: Sum C = 50 × 90 = 4 , 500 \text{Sum}_C = 50 \times 90 = 4,500 Sum C = 50 × 90 = 4 , 500 .
Step 4: Sum total marks and total students: Total Marks = 1 , 500 + 2 , 550 + 4 , 500 = 8 , 550 \text{Total Marks} = 1,500 + 2,550 + 4,500 = 8,550 Total Marks = 1 , 500 + 2 , 550 + 4 , 500 = 8 , 550 Total Students = 20 + 30 + 50 = 100 \text{Total Students} = 20 + 30 + 50 = 100 Total Students = 20 + 30 + 50 = 100
Step 5: Apply combined mean formula: x ˉ comb = 8 , 550 100 = 85.5 \bar{x}_{\text{comb}} = \frac{8,550}{100} = 85.5 x ˉ comb = 100 8 , 550 = 85.5
Worked Example 2: Combinations for Committee Formation
Scenario: A university department consists of 6 male professors and 5 female professors. A research committee of 4 members is to be formed.
Question: In how many ways can the committee be formed such that it contains exactly 2 male professors and 2 female professors?
Step 1: Calculate ways to select 2 male professors from 6: 6 C 2 = 6 × 5 2 × 1 = 15 6C2 = \frac{6 \times 5}{2 \times 1} = 15 6 C 2 = 2 × 1 6 × 5 = 15 .
Step 2: Calculate ways to select 2 female professors from 5: 5 C 2 = 5 × 4 2 × 1 = 10 5C2 = \frac{5 \times 4}{2 \times 1} = 10 5 C 2 = 2 × 1 5 × 4 = 10 .
Step 3: Apply Fundamental Counting Principle (multiply options): Total Ways = 6 C 2 × 5 C 2 = 15 × 10 = 150 ways \text{Total Ways} = 6C2 \times 5C2 = 15 \times 10 = 150 \text{ ways} Total Ways = 6 C 2 × 5 C 2 = 15 × 10 = 150 ways
Worked Example 3: Probability ("At Least One" Coin Toss)
Scenario: A fair six-sided die is rolled 3 times consecutively.
Question: What is the probability of rolling at least one '6' across the 3 rolls?
Step 1: Identify probability of NOT rolling a '6' on a single roll: P ( Not 6 ) = 5 6 P(\text{Not } 6) = \frac{5}{6} P ( Not 6 ) = 6 5 .
Step 2: Calculate probability of rolling NO '6's in all 3 independent rolls: P ( No 6 in 3 rolls ) = ( 5 6 ) 3 = 125 216 P(\text{No } 6 \text{ in 3 rolls}) = \left(\frac{5}{6}\right)^3 = \frac{125}{216} P ( No 6 in 3 rolls ) = ( 6 5 ) 3 = 216 125
Step 3: Apply complementary probability rule: P ( At least one 6 ) = 1 − 125 216 = 216 − 125 216 = 91 216 P(\text{At least one } 6) = 1 - \frac{125}{216} = \frac{216 - 125}{216} = \frac{91}{216} P ( At least one 6 ) = 1 − 216 125 = 216 216 − 125 = 216 91
5. Summary Table: Permutation vs. Combination Decision Matrix
- Attribute Permutations ( n P r nPr n P r ) Combinations ( n C r nCr n C r )
- Core Concept Ordered Arrangements Unordered Groups / Selections
- Order Significance Critical (Order Matters) Irrelevant (Order Does Not Matter)
- Typical Keywords Arrange, Assign, Rank, Sequence, Code, Position Select, Choose, Committee, Team, Sub-group
Formula n P r = n ! ( n − r ) ! nPr = \frac{n!}{(n-r)!} n P r = ( n − r )! n ! n C r = n ! r ! ( n − r ) ! nCr = \frac{n!}{r!(n-r)!} n C r = r ! ( n − r )! n !
Mathematical Relation n P r = n C r × r ! nPr = nCr \times r! n P r = n C r × r ! n C r = n P r r ! nCr = \frac{nPr}{r!} n C r = r ! n P r