Study guide

Number Systems, Divisibility Rules, LCM, HCF & Fractions

OSSSC Staff Nurse / Nursing Officer Recruitment Exam Exam

Track your progress as you read

Finished sections get a check mark.

1 Exam Overview & Preparation Strategy

OSSSC Nursing Officer Exam Pattern, Eligibility & Marking (2026 Advertisement)

2 Anatomy, Physiology & Nursing Foundations

Anatomy & Physiology of Major Body Systems Nursing Process, Clinical Assessment & Care Delivery Vital Signs Monitoring, Normal Ranges, Alterations & Clinical Significance Fluid, Electrolyte Balance & Acid-Base Disturbances

3 Basic Nursing Sciences: Microbiology, Nutrition, Psychology & Sociology

Microbiology: Microorganisms, Staining, Culture, Specimen Collection & Immunity Nutrition: Nutrients, ICMR-NIN Requirements, Deficiency Diseases & Therapeutic Diets Psychology: Learning, Memory, Motivation, Intelligence, Personality & Defence Mechanisms Sociology: Society, Community, Family, Social Groups, Stratification & Social Problems

4 Medical-Surgical Nursing: Systemic Disorders

Cardiovascular & Respiratory Disorders Gastrointestinal, Renal & Endocrine Disorders Neurological & Musculoskeletal Disorders Oncology & Hematological Disorders

5 Perioperative Care & Clinical Pharmacology

Preoperative, Intraoperative & Postoperative Nursing Care Burns Management, Rule of Nines & Wound Care Clinical Pharmacology, Drug Classifications & Safe Administration

6 Midwifery, Obstetric & Gynaecological Nursing

Antenatal Care, Physiological Changes in Pregnancy & Fetal Assessment Stages of Labor, Partograph, Mechanism of Normal Delivery & Episiotomy Obstetric Complications: Hypertensive Disorders, APH, PPH & Ectopic Pregnancy Puerperium: Involution, Lochia, Breastfeeding, Postnatal Care & Complications Family Planning Methods & Common Gynaecological Disorders

7 Pediatric & Neonatal Nursing

Essential Newborn Care, APGAR Scoring & Neonatal Resuscitation Pediatric Growth, Developmental Milestones & Nutritional Deficiencies Common Childhood Illnesses, IMNCI & Pediatric Emergencies

8 Community Health Nursing & Epidemiology

Concepts of Public Health, Levels of Prevention & Epidemiological Triad National Health Programs & National Immunization Schedule in India Communicable & Non-Communicable Disease Control

9 Mental Health & Psychiatric Nursing

Principles of Psychiatric Nursing, Mental Health Assessment & Therapeutic Communication Major Psychiatric Disorders: Psychoses, Mood Disorders, Anxiety & Substance Use Psychopharmacology, Emergency Psychiatry & Somatic Therapies

10 Professional Nursing: Ethics, Education, Research & Management

Professionalism, Professional Values, Ethics & Legal Aspects of Nursing Nursing Education: Teaching-Learning Principles, Methods, AV Aids, Lesson Plans & Evaluation Nursing Research & Biostatistics: Research Process, Designs, Sampling, Ethics & Statistical Measures Nursing Administration & Management: Principles, Staffing, Patient Assignment, Leadership, Materials & Quality

11 Clinical Nursing Skills & Bedside Procedures

Medication Administration: Oral, IM, IV, SC, ID & Z-Track Technique Enteral Feeding, Nasogastric Tube Insertion & Urinary Catheterization Intravenous Cannulation, Fluid Calculation & Blood Transfusion Protocols Airway Care, Oxygen Therapy Devices, Endotracheal & Tracheostomy Suctioning

12 Infection Control, First Aid & Emergency Life Support

Hospital Infection Control, Standard Precautions, PPE & Sterilization Methods Bio-Medical Waste Management Rules 2016, Color Coding & Segregation Basic Life Support, CPR Guidelines, Defibrillation & Disaster Triage First Aid for Common Emergencies: Bleeding, Fractures, Burns, Poisoning, Bites, Heat & Choking

13 HSC Standard Arithmetic & Quantitative Aptitude

Number Systems, Divisibility Rules, LCM, HCF & Fractions Ratios, Proportions, Percentages & Unitary Method Profit & Loss, Discounts, Simple & Compound Interest Averages, Time & Work, Speed, Distance & Clinical Dose Calculations

14 HSC Standard English Grammar & Usage

Parts of Speech, Articles & Essential Prepositions Tenses, Subject-Verb Agreement & Error Spotting Active-Passive Voice, Direct-Indirect Speech & Medical Vocabulary

Number Systems, Divisibility Rules, LCM, HCF & Fractions

Key Takeaways Explain This Topic AI

The real number system classifies numerical values into Natural numbers (ℕ), Whole numbers (𝕎), Integers (ℤ), Rational numbers (ℚ), and Irrational numbers, with exactly 25 prime numbers existing below 100 and 2 standing as the sole even prime.

Divisibility rules allow rapid modular verification without long division, prominently featuring the alternating sum test for 11 where the absolute difference between sums of digits at odd and even positions must equal 0 or a multiple of 11.

The BODMAS / PEMDAS operational hierarchy strictly governs arithmetic expressions, executing operations in the immutable sequence of Brackets (vinculum/bar, parentheses, curly braces, square brackets), Orders/Powers, Division, Multiplication, Addition, and Subtraction.

For any two positive integers a and b, the fundamental product theorem establishes that HCF(a, b) × LCM(a, b) = a × b, while fraction operations require computing HCF as HCF(numerators)/LCM(denominators) and LCM as LCM(numerators)/HCF(denominators).

Recurring decimals convert into vulgar fractions through standardized algebraic expansions, where pure repeating decimals follow 0.p̄ = p/9 and mixed repeating decimals follow 0.ab̄ = (ab - a)/90.

Last updated: October 2026

Quantitative aptitude in the Odisha Sub-Ordinate Staff Selection Commission (OSSSC) Staff Nurse / Nursing Officer examination assesses high-school certificate (HSC) standard arithmetic. Clinicians routinely execute rapid mental arithmetic when calculating pediatric dosages, titrating intravenous drop rates, verifying stock inventory, and interpreting clinical laboratory indices. A solid mastery of number classifications, modular divisibility, operational precedence (BODMAS), common factors, multiples, and fractional representations forms the bedrock of numerical accuracy in healthcare practice.

1. Classification of Number Systems

All numbers utilized in standard arithmetic belong to the system of Real Numbers (ℝ) , which encompasses all values that can be represented along a continuous geometric number line. Real Numbers (ℝ)

  • / \
  • Rational Numbers (ℚ) Irrational Numbers
  • / \
  • Integers (ℤ) Fractions & Decimals
  • / \
  • Negative Integers Whole Numbers (𝕎)
  • / \
  • Zero (0) Natural Numbers (ℕ)
  • / | \
  • Primes Composites Unity (1)
  • Core Sets of Numbers

Natural Numbers (ℕ): The positive counting integers starting from unity: N = { 1 , 2 , 3 , 4 , 5 , … } \mathbb{N} = \{1, 2, 3, 4, 5, \dots\} N = { 1 , 2 , 3 , 4 , 5 , … } .

Whole Numbers (𝕎): The natural numbers augmented by zero: W = { 0 , 1 , 2 , 3 , 4 , … } \mathbb{W} = \{0, 1, 2, 3, 4, \dots\} W = { 0 , 1 , 2 , 3 , 4 , … } . Zero is the only whole number that is not a natural number.

Integers (ℤ): The complete set of positive integers, negative integers, and zero: Z = { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } \mathbb{Z} = \{\dots, -3, -2, -1, 0, 1, 2, 3, \dots\} Z = { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } .

  • Positive Integers: { 1 , 2 , 3 , … } \{1, 2, 3, \dots\} { 1 , 2 , 3 , … }
  • Negative Integers: { − 1 , − 2 , − 3 , … } \{-1, -2, -3, \dots\} { − 1 , − 2 , − 3 , … }

Zero (0): Neutral integer; neither positive nor negative, but strictly even.

Rational Numbers (ℚ): Any number that can be expressed in the quotient form p q \frac{p}{q} q p ​ , where p p p and q q q are integers and q ≠ 0 q \neq 0 q  = 0 . When converted to decimal form, rational numbers either terminate (e.g., 3 4 = 0.75 \frac{3}{4} = 0.75 4 3 ​ = 0.75 ) or repeat indefinitely in a recurring pattern (e.g., 1 3 = 0.333 ⋯ = 0. 3 ˉ \frac{1}{3} = 0.333\dots = 0.\bar{3} 3 1 ​ = 0.333 ⋯ = 0. 3 ˉ ).

Irrational Numbers: Numbers that cannot be expressed as a ratio of two integers. Their decimal expansions are non-terminating and non-repeating (e.g., 2 ≈ 1.4142 … \sqrt{2} \approx 1.4142\dots 2 ​ ≈ 1.4142 … , 3 ≈ 1.7320 … \sqrt{3} \approx 1.7320\dots 3 ​ ≈ 1.7320 … , π ≈ 3.14159 … \pi \approx 3.14159\dots π ≈ 3.14159 … , and Euler's constant e ≈ 2.71828 … e \approx 2.71828\dots e ≈ 2.71828 … ).

Real Numbers (ℝ): The unified set of all rational and irrational numbers: R = Q ∪ Irrationals \mathbb{R} = \mathbb{Q} \cup \text{Irrationals} R = Q ∪ Irrationals .

Prime, Composite, and Related Classifications

Prime Numbers: Any natural number strictly greater than 1 that possesses exactly two distinct positive divisors: 1 and the number itself.

The number 1 is neither prime nor composite (it has only one divisor).

The number 2 is the smallest prime number and the only even prime number in existence. All other prime numbers are odd.

Prime Numbers Under 100: Exactly 25 prime numbers exist between 1 and 100: { 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 53 , 59 , 61 , 67 , 71 , 73 , 79 , 83 , 89 , 97 } \{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97\} { 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 53 , 59 , 61 , 67 , 71 , 73 , 79 , 83 , 89 , 97 }

Distribution: 1 to 50 contains 15 primes; 51 to 100 contains 10 primes.

Composite Numbers: Natural numbers greater than 1 that possess more than two distinct positive divisors (e.g., 4, 6, 8, 9, 10, 12, ...). The number 4 is the smallest composite number .

Twin Primes: Pairs of prime numbers that differ by exactly 2. There are 8 pairs of twin primes below 100: ( 3 , 5 ) , ( 5 , 7 ) , ( 11 , 13 ) , ( 17 , 19 ) , ( 29 , 31 ) , ( 41 , 43 ) , ( 59 , 61 ) , and ( 71 , 73 ) (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), \text{ and } (71, 73) ( 3 , 5 ) , ( 5 , 7 ) , ( 11 , 13 ) , ( 17 , 19 ) , ( 29 , 31 ) , ( 41 , 43 ) , ( 59 , 61 ) , and ( 71 , 73 ) .

Co-Prime (Relatively Prime) Numbers: Two positive integers a a a and b b b whose Highest Common Factor is 1, denoted HCF ( a , b ) = 1 \text{HCF}(a, b) = 1 HCF ( a , b ) = 1 . The individual numbers do not need to be prime themselves. For instance, 8 (composite) and 15 (composite) are co-prime because their only common factor is 1.

Primality Testing Algorithm: To determine whether an integer N N N is prime, test for divisibility by all prime numbers p p p such that p ≤ N p \le \sqrt{N} p ≤ N ​ . If no prime up to N \sqrt{N} N ​ divides N N N , then N N N is guaranteed to be prime.

Worked Example: Test if 173 is prime. Calculate 173 ≈ 13.15 \sqrt{173} \approx 13.15 173 ​ ≈ 13.15 . Primes to test are 2, 3, 5, 7, 11, 13. 173 ends in 3 (not div by 2 or 5); sum of digits 1 + 7 + 3 = 11 1+7+3=11 1 + 7 + 3 = 11 (not div by 3); 173 ÷ 7 = 24.71 173 \div 7 = 24.71 173 ÷ 7 = 24.71 ; 173 ÷ 11 = 15.72 173 \div 11 = 15.72 173 ÷ 11 = 15.72 ; 173 ÷ 13 = 13.30 173 \div 13 = 13.30 173 ÷ 13 = 13.30 . Because none divide 173 evenly, 173 is prime .

Loading diagram... Hierarchical Structure of the Real Number System

2. Divisibility Rules & Systematic Verification

Divisibility tests enable rapid identification of factors and prime reductions without executing manual long division. These rules are indispensable for factoring drug dosages, scheduling shift rotations, and simplifying arithmetic fractions.

Divisibility Criteria Summary Table

Divisor Mathematical Test / Criterion Illustrative Example

2 The units digit is an even integer (0, 2, 4, 6, or 8). 4,856 ends in 6 (even) → \rightarrow → Divisible by 2.

3 The sum of all constituent digits is divisible by 3. 7,419: 7 + 4 + 1 + 9 = 21 7 + 4 + 1 + 9 = 21 7 + 4 + 1 + 9 = 21 . Since 21 ÷ 3 = 7 21 \div 3 = 7 21 ÷ 3 = 7 → \rightarrow → Divisible by 3.

4 The number formed by the last two digits (tens and units) is divisible by 4, or ends in double zero (00). 35,728: Last two digits are 28. Since 28 ÷ 4 = 7 28 \div 4 = 7 28 ÷ 4 = 7 → \rightarrow → Divisible by 4.

5 The units digit is either 0 or 5. 12,485 ends in 5 → \rightarrow → Divisible by 5.

6 The number satisfies both divisibility by 2 (even units digit) AND divisibility by 3 (sum of digits divisible by 3). 9,216: Ends in 6 (divisible by 2); sum 9 + 2 + 1 + 6 = 18 9+2+1+6 = 18 9 + 2 + 1 + 6 = 18 (divisible by 3) → \rightarrow → Divisible by 6.

8 The number formed by the last three digits is divisible by 8, or ends in triple zero (000). 54,168: Last three digits are 168. Since 168 ÷ 8 = 21 168 \div 8 = 21 168 ÷ 8 = 21 → \rightarrow → Divisible by 8.

9 The sum of all constituent digits is divisible by 9. 84,528: 8 + 4 + 5 + 2 + 8 = 27 8 + 4 + 5 + 2 + 8 = 27 8 + 4 + 5 + 2 + 8 = 27 . Since 27 ÷ 9 = 3 27 \div 9 = 3 27 ÷ 9 = 3 → \rightarrow → Divisible by 9.

10 The units digit is strictly 0. 47,930 ends in 0 → \rightarrow → Divisible by 10.

11 The absolute difference between the sum of digits at odd places and the sum of digits at even places is either 0 or a multiple of 11. 94,853: Odd places sum ( 3 + 8 + 9 ) = 20 (3 + 8 + 9) = 20 ( 3 + 8 + 9 ) = 20 ; Even places sum ( 5 + 4 ) = 9 (5 + 4) = 9 ( 5 + 4 ) = 9 . Difference: 20 − 9 = 11 20 - 9 = 11 20 − 9 = 11 → \rightarrow → Divisible by 11.

12 The number satisfies both divisibility by 3 AND divisibility by 4 (co-prime factors of 12). 1,728: Sum 1 + 7 + 2 + 8 = 18 1+7+2+8=18 1 + 7 + 2 + 8 = 18 (divisible by 3); last two digits 28 (divisible by 4) → \rightarrow → Divisible by 12.

The Alternating Sum Rule for 11 (Detailed Walkthrough)

The divisibility rule for 11 stems from the modular expansion of powers of 10: 10 ≡ − 1 ( m o d 11 ) 10 \equiv -1 \pmod{11} 10 ≡ − 1 ( mod 11 ) , 10 2 ≡ 1 ( m o d 11 ) 10^2 \equiv 1 \pmod{11} 1 0 2 ≡ 1 ( mod 11 ) , 10 3 ≡ − 1 ( m o d 11 ) 10^3 \equiv -1 \pmod{11} 1 0 3 ≡ − 1 ( mod 11 ) , and so forth. Consequently, any integer N = a n 10 n + ⋯ + a 1 10 + a 0 N = a_n 10^n + \dots + a_1 10 + a_0 N = a n ​ 1 0 n + ⋯ + a 1 ​ 10 + a 0 ​ satisfies: N ≡ a 0 − a 1 + a 2 − a 3 + … ( m o d 11 ) N \equiv a_0 - a_1 + a_2 - a_3 + \dots \pmod{11} N ≡ a 0 ​ − a 1 ​ + a 2 ​ − a 3 ​ + … ( mod 11 )

Step 1: Number digit positions from right to left (Position 1 = units digit, Position 2 = tens digit, Position 3 = hundreds digit, etc.).

Step 2: Calculate S odd = sum of digits at positions 1, 3, 5, 7, … S_{\text{odd}} = \text{sum of digits at positions 1, 3, 5, 7, } \dots S odd ​ = sum of digits at positions 1, 3, 5, 7, …

Step 3: Calculate S even = sum of digits at positions 2, 4, 6, 8, … S_{\text{even}} = \text{sum of digits at positions 2, 4, 6, 8, } \dots S even ​ = sum of digits at positions 2, 4, 6, 8, …

Step 4: Compute the absolute difference ∣ S odd − S even ∣ |S_{\text{odd}} - S_{\text{even}}| ∣ S odd ​ − S even ​ ∣ . If the result is 0, 11, 22, 33, or any multiple of 11, the entire original number is divisible by 11.

Worked Clinical Application: A batch of 85,976 surgical gloves is delivered to the hospital stores. Can this shipment be divided equally into 11 regional community health center parcels without opening individual packets?

  • Digits at odd places (from right): 6 + 9 + 8 = 23 6 + 9 + 8 = 23 6 + 9 + 8 = 23
  • Digits at even places (from right): 7 + 5 = 12 7 + 5 = 12 7 + 5 = 12
  • Difference: 23 − 12 = 11 23 - 12 = 11 23 − 12 = 11

Conclusion: Because 11 is divisible by 11, 85,976 is exactly divisible by 11 ( 85,976 ÷ 11 = 7,816 85{,}976 \div 11 = 7{,}816 85 , 976 ÷ 11 = 7 , 816 gloves per center).

3. Order of Operations: BODMAS / PEMDAS Rule

When evaluating complex arithmetic expressions with multiple nested grouping symbols and operational operators, computations must proceed according to the standardized BODMAS operational hierarchy.

The Hierarchy of Precedence

B — Brackets (Grouping Symbols): Evaluated strictly from the inside outward:

Vinculum / Bar (—): Cleared first: e.g., 8 − 5 − 2 ‾ = 8 − 3 = 5 8 - \overline{5 - 2} = 8 - 3 = 5 8 − 5 − 2 ​ = 8 − 3 = 5 .

Round Brackets / Parentheses ( ): Evaluated second.

Curly Brackets / Braces { }: Evaluated third.

Square Brackets / Box [ ]: Evaluated fourth.

O — Orders / Of: Denotes powers, exponents, roots, and the mathematical preposition "of". Note that "of" signifies multiplication but takes operational precedence over division and multiplication (e.g., 1 3 of 15 = 5 \frac{1}{3} \text{ of } 15 = 5 3 1 ​ of 15 = 5 ).

D — Division (÷) & M — Multiplication (×): Possess equal operational rank, evaluated strictly from left to right as they appear in the expression.

A — Addition (+) & S — Subtraction (−): Possess equal operational rank, evaluated strictly from left to right .

Fundamental Algebraic Sign Rules

( + ) × ( + ) = + (+) \times (+) = + ( + ) × ( + ) = + and ( − ) × ( − ) = + (-) \times (-) = + ( − ) × ( − ) = + (Product of like signs is positive).

( + ) × ( − ) = − (+) \times (-) = - ( + ) × ( − ) = − and ( − ) × ( + ) = − (-) \times (+) = - ( − ) × ( + ) = − (Product of unlike signs is negative).

Division follows identical sign properties: ( − ) ÷ ( − ) = + (-) \div (-) = + ( − ) ÷ ( − ) = + and ( − ) ÷ ( + ) = − (-) \div (+) = - ( − ) ÷ ( + ) = − .

Subtracting a negative quantity is equivalent to addition: a − ( − b ) = a + b a - (-b) = a + b a − ( − b ) = a + b .

Step-by-Step Worked Simplification Example

Evaluate the following expression: E = 48 ÷ 4 of 3 + [ 18 − { 6 + ( 14 − 8 − 3 ‾ ) } ] E = 48 \div 4 \text{ of } 3 + [18 - \{6 + (14 - \overline{8 - 3})\}] E = 48 ÷ 4 of 3 + [ 18 − { 6 + ( 14 − 8 − 3 ​ )}]

Step 1 (Vinculum): Evaluate the bar bracket: 8 − 3 ‾ = 5 \overline{8 - 3} = 5 8 − 3 ​ = 5 . E = 48 ÷ 4 of 3 + [ 18 − { 6 + ( 14 − 5 ) } ] E = 48 \div 4 \text{ of } 3 + [18 - \{6 + (14 - 5)\}] E = 48 ÷ 4 of 3 + [ 18 − { 6 + ( 14 − 5 )}]

Step 2 (Parentheses): Evaluate round brackets: ( 14 − 5 ) = 9 (14 - 5) = 9 ( 14 − 5 ) = 9 . E = 48 ÷ 4 of 3 + [ 18 − { 6 + 9 } ] E = 48 \div 4 \text{ of } 3 + [18 - \{6 + 9\}] E = 48 ÷ 4 of 3 + [ 18 − { 6 + 9 }]

Step 3 (Braces): Evaluate curly braces: { 6 + 9 } = 15 \{6 + 9\} = 15 { 6 + 9 } = 15 . E = 48 ÷ 4 of 3 + [ 18 − 15 ] E = 48 \div 4 \text{ of } 3 + [18 - 15] E = 48 ÷ 4 of 3 + [ 18 − 15 ]

Step 4 (Square Brackets): Evaluate square brackets: [ 18 − 15 ] = 3 [18 - 15] = 3 [ 18 − 15 ] = 3 . E = 48 ÷ 4 of 3 + 3 E = 48 \div 4 \text{ of } 3 + 3 E = 48 ÷ 4 of 3 + 3

Step 5 ("Of" Precedence): Evaluate "of" before division: 4 of 3 = 4 × 3 = 12 4 \text{ of } 3 = 4 \times 3 = 12 4 of 3 = 4 × 3 = 12 . E = 48 ÷ 12 + 3 E = 48 \div 12 + 3 E = 48 ÷ 12 + 3

Step 6 (Division): Perform division: 48 ÷ 12 = 4 48 \div 12 = 4 48 ÷ 12 = 4 . E = 4 + 3 E = 4 + 3 E = 4 + 3

Step 7 (Addition): Compute final sum: 4 + 3 = 7 4 + 3 = 7 4 + 3 = 7 .

Final Result: 7 .

4. Highest Common Factor (HCF) & Least Common Multiple (LCM)

Finding common measures and synchronized intervals forms a routine component of resource scheduling and packaging in healthcare administration.

Mathematical Definitions

Highest Common Factor (HCF / GCD): The greatest positive integer that divides each of two or more given integers without leaving a remainder. HCF represents the largest possible common grouping size.

Least Common Multiple (LCM): The smallest positive integer that is divisible by each of two or more given integers. LCM represents the earliest point of synchronization or alignment.

  • Analytical Methods for Computation
  • 1. Prime Factorization Method

Express each integer as a product of prime powers:

HCF \text{HCF} HCF is obtained by taking the lowest power of each common prime factor .

LCM \text{LCM} LCM is obtained by taking the highest power of every prime factor present across all numbers.

Worked Example: Find HCF and LCM of 72, 108, and 180.

  • 72 = 2 3 × 3 2 72 = 2^3 \times 3^2 72 = 2 3 × 3 2
  • 108 = 2 2 × 3 3 108 = 2^2 \times 3^3 108 = 2 2 × 3 3
  • 180 = 2 2 × 3 2 × 5 1 180 = 2^2 \times 3^2 \times 5^1 180 = 2 2 × 3 2 × 5 1

HCF = 2 min ⁡ ( 3 , 2 , 2 ) × 3 min ⁡ ( 2 , 3 , 2 ) × 5 min ⁡ ( 0 , 0 , 1 ) = 2 2 × 3 2 × 1 = 4 × 9 = 36 \text{HCF} = 2^{\min(3,2,2)} \times 3^{\min(2,3,2)} \times 5^{\min(0,0,1)} = 2^2 \times 3^2 \times 1 = 4 \times 9 = \mathbf{36} HCF = 2 m i n ( 3 , 2 , 2 ) × 3 m i n ( 2 , 3 , 2 ) × 5 m i n ( 0 , 0 , 1 ) = 2 2 × 3 2 × 1 = 4 × 9 = 36 .

LCM = 2 max ⁡ ( 3 , 2 , 2 ) × 3 max ⁡ ( 2 , 3 , 2 ) × 5 max ⁡ ( 0 , 0 , 1 ) = 2 3 × 3 3 × 5 1 = 8 × 27 × 5 = 1,080 \text{LCM} = 2^{\max(3,2,2)} \times 3^{\max(2,3,2)} \times 5^{\max(0,0,1)} = 2^3 \times 3^3 \times 5^1 = 8 \times 27 \times 5 = \mathbf{1{,}080} LCM = 2 m a x ( 3 , 2 , 2 ) × 3 m a x ( 2 , 3 , 2 ) × 5 m a x ( 0 , 0 , 1 ) = 2 3 × 3 3 × 5 1 = 8 × 27 × 5 = 1 , 080 .

2. The Fundamental Product Theorem for Two Numbers

For any two positive integers a a a and b b b , the product of their HCF and LCM is identically equal to the product of the two numbers: HCF ( a , b ) × LCM ( a , b ) = a × b \text{HCF}(a, b) \times \text{LCM}(a, b) = a \times b HCF ( a , b ) × LCM ( a , b ) = a × b ⟹ a = HCF × LCM b and LCM = a × b HCF \implies a = \frac{\text{HCF} \times \text{LCM}}{b} \quad \text{and} \quad \text{LCM} = \frac{a \times b}{\text{HCF}} ⟹ a = b HCF × LCM ​ and LCM = HCF a × b ​ (Note: This direct product identity holds strictly for two numbers; it does not generalize to sets of three or more numbers).

HCF and LCM of Fractions

When dealing with rational quantities, formulas operate across numerators and denominators: HCF of Fractions = HCF of Numerators LCM of Denominators \text{HCF of Fractions} = \frac{\text{HCF of Numerators}}{\text{LCM of Denominators}} HCF of Fractions = LCM of Denominators HCF of Numerators ​ LCM of Fractions = LCM of Numerators HCF of Denominators \text{LCM of Fractions} = \frac{\text{LCM of Numerators}}{\text{HCF of Denominators}} LCM of Fractions = HCF of Denominators LCM of Numerators ​ (Prerequisite: All fractions must first be reduced to their simplest irreducible form before applying these formulas).

Worked Example: Find HCF and LCM of 2 3 , 8 9 , and 16 81 \frac{2}{3}, \frac{8}{9}, \text{ and } \frac{16}{81} 3 2 ​ , 9 8 ​ , and 81 16 ​ .

All fractions are already irreducible.

Numerators: { 2 , 8 , 16 } \{2, 8, 16\} { 2 , 8 , 16 } . Denominators: { 3 , 9 , 81 } \{3, 9, 81\} { 3 , 9 , 81 } .

HCF of numerators ( 2 , 8 , 16 ) = 2 \text{HCF of numerators}(2, 8, 16) = 2 HCF of numerators ( 2 , 8 , 16 ) = 2 .

LCM of denominators ( 3 , 9 , 81 ) = 81 \text{LCM of denominators}(3, 9, 81) = 81 LCM of denominators ( 3 , 9 , 81 ) = 81 .

LCM of numerators ( 2 , 8 , 16 ) = 16 \text{LCM of numerators}(2, 8, 16) = 16 LCM of numerators ( 2 , 8 , 16 ) = 16 .

HCF of denominators ( 3 , 9 , 81 ) = 3 \text{HCF of denominators}(3, 9, 81) = 3 HCF of denominators ( 3 , 9 , 81 ) = 3 .

Therefore: HCF = 2 81 and LCM = 16 3 \text{HCF} = \frac{2}{81} \quad \text{and} \quad \text{LCM} = \frac{16}{3} HCF = 81 2 ​ and LCM = 3 16 ​

Standard Application Word Problems

Synchronized Periodic Events (Bells / Alarms / Medication Rounds):

Problem: In an intensive care unit, three infusion pump alarms chime at intervals of 12 seconds, 15 seconds, and 20 seconds respectively. If they all chime simultaneously at 08:00 AM, at what time will they next chime together?

Method: The synchronized interval is given by LCM ( 12 , 15 , 20 ) \text{LCM}(12, 15, 20) LCM ( 12 , 15 , 20 ) .

  • 12 = 2 2 × 3 12 = 2^2 \times 3 12 = 2 2 × 3
  • 15 = 3 × 5 15 = 3 \times 5 15 = 3 × 5
  • 20 = 2 2 × 5 20 = 2^2 \times 5 20 = 2 2 × 5

LCM = 2 2 × 3 × 5 = 60 seconds = 1 minute \text{LCM} = 2^2 \times 3 \times 5 = 60\text{ seconds} = 1\text{ minute} LCM = 2 2 × 3 × 5 = 60 seconds = 1 minute .

Solution: The alarms will chime together next at 08:01 AM .

Partitioning and Equal Distribution (Maximum Measuring Capacity):

Problem: A nursing supervisor has 120 ampoules of Paracetamol, 144 ampoules of Tramadol, and 192 ampoules of Ondansetron. She wishes to package them into emergency crash carts such that each cart receives identical contents with no ampoules left over. What is the maximum number of crash carts that can be equipped?

Method: The maximum uniform quantity is the HCF ( 120 , 144 , 192 ) \text{HCF}(120, 144, 192) HCF ( 120 , 144 , 192 ) .

  • 120 = 2 3 × 3 × 5 120 = 2^3 \times 3 \times 5 120 = 2 3 × 3 × 5
  • 144 = 2 4 × 3 2 144 = 2^4 \times 3^2 144 = 2 4 × 3 2
  • 192 = 2 6 × 3 192 = 2^6 \times 3 192 = 2 6 × 3

HCF = 2 3 × 3 = 8 × 3 = 24 \text{HCF} = 2^3 \times 3 = 8 \times 3 = 24 HCF = 2 3 × 3 = 8 × 3 = 24 .

Solution: At most 24 crash carts can be equipped, each holding 5 Paracetamol, 6 Tramadol and 8 Ondansetron ampoules ( 120 ÷ 24 = 5 120 \div 24 = 5 120 ÷ 24 = 5 , 144 ÷ 24 = 6 144 \div 24 = 6 144 ÷ 24 = 6 , 192 ÷ 24 = 8 192 \div 24 = 8 192 ÷ 24 = 8 ).

Modular Remainder Problems:

Finding the greatest number dividing x , y , z x, y, z x , y , z leaving remainders a , b , c a, b, c a , b , c : Required Divisor = HCF ( x − a , y − b , z − c ) \text{Required Divisor} = \text{HCF}(x - a, y - b, z - c) Required Divisor = HCF ( x − a , y − b , z − c )

Finding the least number divided by x , y , z x, y, z x , y , z leaving constant remainder r r r : Required Number = LCM ( x , y , z ) + r \text{Required Number} = \text{LCM}(x, y, z) + r Required Number = LCM ( x , y , z ) + r

5. Fractions, Decimals & Recurring Decimal Expansions

Fractions quantify rational portions of a whole, operating throughout pharmacokinetics, laboratory dilutions, and demographic calculations.

Classification of Fractions

Proper Fraction: Numerator is strictly less than denominator ( p q \frac{p}{q} q p ​ with p < q p < q p < q ), such as 3 7 \frac{3}{7} 7 3 ​ . The value is always strictly less than 1.

Improper Fraction: Numerator is greater than or equal to denominator ( p ≥ q p \ge q p ≥ q ), such as 11 4 \frac{11}{4} 4 11 ​ . The value is ≥ 1 \ge 1 ≥ 1 .

Mixed Fraction: Combination of an integer whole number and a proper fraction: 2 3 4 = 2 + 3 4 = 2 × 4 + 3 4 = 11 4 2 \frac{3}{4} = 2 + \frac{3}{4} = \frac{2 \times 4 + 3}{4} = \frac{11}{4} 2 4 3 ​ = 2 + 4 3 ​ = 4 2 × 4 + 3 ​ = 4 11 ​ .

Equivalent Fractions: Fractions that represent the identical value when reduced to lowest terms: 2 3 = 4 6 = 6 9 = 20 30 \frac{2}{3} = \frac{4}{6} = \frac{6}{9} = \frac{20}{30} 3 2 ​ = 6 4 ​ = 9 6 ​ = 30 20 ​ .

Comparing Fractions: Rapid Techniques

Cross-Multiplication Method (Best for Two Fractions):

To compare a b \frac{a}{b} b a ​ and c d \frac{c}{d} d c ​ :

Compute product a × d a \times d a × d and product b × c b \times c b × c .

If a × d > b × c a \times d > b \times c a × d > b × c , then a b > c d \frac{a}{b} > \frac{c}{d} b a ​ > d c ​ .

If a × d < b × c a \times d < b \times c a × d < b × c , then a b < c d \frac{a}{b} < \frac{c}{d} b a ​ < d c ​ .

Example: Compare 5 8 \frac{5}{8} 8 5 ​ and 7 11 \frac{7}{11} 11 7 ​ . Compute 5 × 11 = 55 5 \times 11 = 55 5 × 11 = 55 and 8 × 7 = 56 8 \times 7 = 56 8 × 7 = 56 . Since 55 < 56 55 < 56 55 < 56 , it follows that 5 8 < 7 11 \frac{5}{8} < \frac{7}{11} 8 5 ​ < 11 7 ​ .

Equating Denominators via LCM (Best for Three or More Fractions):

Find LCM of all denominators, scale numerators proportionately, and compare resulting numerators.

Decimals & Recurring Decimal Conversion

Decimals are either terminating (denominator in irreducible form contains only prime factors of 2 and/or 5) or non-terminating recurring .

1. Pure Recurring Decimals

A decimal in which all digits immediately following the decimal point repeat indefinitely.

Conversion Rule: Place the repeating digits in the numerator, and place as many 9s in the denominator as there are repeating digits: 0. a ˉ = a 9 , 0. a b ‾ = a b 99 , 0. a b c ‾ = a b c 999 0.\bar{a} = \frac{a}{9}, \quad 0.\overline{ab} = \frac{ab}{99}, \quad 0.\overline{abc} = \frac{abc}{999} 0. a ˉ = 9 a ​ , 0. ab = 99 ab ​ , 0. ab c = 999 ab c ​

Examples:

  • 0. 6 ˉ = 6 9 = 2 3 0.\bar{6} = \frac{6}{9} = \frac{2}{3} 0. 6 ˉ = 9 6 ​ = 3 2 ​
  • 0. 36 ‾ = 36 99 = 4 11 0.\overline{36} = \frac{36}{99} = \frac{4}{11} 0. 36 = 99 36 ​ = 11 4 ​

0. 142857 ‾ = 142857 999999 = 1 7 0.\overline{142857} = \frac{142857}{999999} = \frac{1}{7} 0. 142857 = 999999 142857 ​ = 7 1 ​

2. Mixed Recurring Decimals

A decimal in which some digits after the decimal point do not repeat, followed by digits that repeat indefinitely.

Conversion Rule: In the numerator, subtract the non-repeating digits from the entire sequence of digits up to the end of the first repeating block. In the denominator, write as many 9s as there are repeating digits, followed by as many 0s as there are non-repeating digits: 0. a b ˉ = a b − a 90 0.a\bar{b} = \frac{ab - a}{90} 0. a b ˉ = 90 ab − a ​ 0. a b c ˉ = a b c − a b 900 0.ab\bar{c} = \frac{abc - ab}{900} 0. ab c ˉ = 900 ab c − ab ​ 0. a b c ‾ = a b c − a 990 0.a\overline{bc} = \frac{abc - a}{990} 0. a b c = 990 ab c − a ​

Worked Examples:

Convert 0.4 7 ˉ 0.4\bar{7} 0.4 7 ˉ to a vulgar fraction: 0.4 7 ˉ = 47 − 4 90 = 43 90 0.4\bar{7} = \frac{47 - 4}{90} = \frac{43}{90} 0.4 7 ˉ = 90 47 − 4 ​ = 90 43 ​

Convert 0.1 6 ˉ 0.1\bar{6} 0.1 6 ˉ to a vulgar fraction: 0.1 6 ˉ = 16 − 1 90 = 15 90 = 1 6 0.1\bar{6} = \frac{16 - 1}{90} = \frac{15}{90} = \frac{1}{6} 0.1 6 ˉ = 90 16 − 1 ​ = 90 15 ​ = 6 1 ​

Convert 0.12 3 ˉ 0.12\bar{3} 0.12 3 ˉ to a vulgar fraction: 0.12 3 ˉ = 123 − 12 900 = 111 900 = 37 300 0.12\bar{3} = \frac{123 - 12}{900} = \frac{111}{900} = \frac{37}{300} 0.12 3 ˉ = 900 123 − 12 ​ = 900 111 ​ = 300 37 ​