Competive Exam Math 10 : How many 3-digit numbers can be formed from 1, 2, 5, 6, 7, 8 without repetition ? , (If 0 is included & 0 is not included)


Q. How many 3-digit numbers can be formed from 1, 2, 5, 6, 7, 8 without repetition ? Q. 1, 2, 5, 6, 7, 8 āϏāĻ‚āĻ–ā§āϝāĻžāĻŦā§‹ā§° āĻĒ⧁āύ⧰āĻžāĻŦ⧃āĻ¤ā§āϤāĻŋ āύāϕ⧰āĻžāĻ•ā§ˆ āĻ•āĻŋāĻŽāĻžāύāϟāĻž 3-āĻ…āĻ‚āϕ⧰ āϏāĻ‚āĻ–ā§āϝāĻž āĻ—āĻ āύ āϕ⧰āĻŋāĻŦ āĻĒāĻžā§°āĻŋ ?


Trick | āĻŸā§ā§°āĻŋāĻ•


6 digits → 3 places : ā§ŦāϟāĻž āϏāĻ‚āĻ–ā§āϝāĻž → ā§ŠāϟāĻž āĻ¸ā§āĻĨāĻžāύ



  • 1st place = 6 choices : ā§§āĻŽ āĻ¸ā§āĻĨāĻžāύ = 6āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ

  • 2nd place = 5 choices : ā§¨āϝāĻŧ āĻ¸ā§āĻĨāĻžāύ = 5āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ

  • 3rd place = 4 choices : ā§ŠāϝāĻŧ āĻ¸ā§āĻĨāĻžāύ = 4āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ


6 × 5 × 4 = 120 


Trick | āĻŸā§ā§°āĻŋāĻ•


Without repetition (āĻĒ⧁āύ⧰āĻžāĻŦ⧃āĻ¤ā§āϤāĻŋ āύ⧋āĻšā§‹ā§ąāĻžāĻ•ā§ˆ):


n × (n−1) × (n−2)


Here,


6 × 5 × 4 = 120


Ans | āωāĻ¤ā§āϤ⧰: (C) 120


Note: "0" is not included


========================================


Q. How many 3-digit numbers can be formed from the digits 0, 1, 3, 4, 5, 6 without repetition ? Q. 0, 1, 3, 4, 5, 6 āϏāĻ‚āĻ–ā§āϝāĻžāĻŦā§‹ā§° āĻĒ⧁āύ⧰āĻžāĻŦ⧃āĻ¤ā§āϤāĻŋ āύāϕ⧰āĻžāĻ•ā§ˆ āĻ•āĻŋāĻŽāĻžāύāϟāĻž 3-āĻ…āĻ‚āϕ⧰ āϏāĻ‚āĻ–ā§āϝāĻž āĻ—āĻ āύ āϕ⧰āĻŋāĻŦ āĻĒāĻžā§°āĻŋ ?


Options | āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ:(A) 100 (B) 120 (C) 60 (D) 50


Trick | āĻŸā§ā§°āĻŋāĻ• : There are 6 digits, but 0 cannot be in the first place. (āĻŽā§āĻ  6āϟāĻž āϏāĻ‚āĻ–ā§āϝāĻž āφāϛ⧇, āĻ•āĻŋāĻ¨ā§āϤ⧁ āĻĒā§ā§°āĻĨāĻŽ āĻ¸ā§āĻĨāĻžāύāϤ 0 āĻĨāĻžāĻ•āĻŋāĻŦ āĻ¨ā§‹ā§ąāĻžā§°ā§‡āĨ¤)



  • 1st place: 5 choices (1, 3, 4, 5, 6) // ā§§āĻŽ āĻ¸ā§āĻĨāĻžāύ: 5āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ (1, 3, 4, 5, 6)

  • 2nd place: 5 choices (including 0) // ⧍āϝāĻŧ āĻ¸ā§āĻĨāĻžāύ: 5āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ (0āϏāĻš)

  • 3rd place: 4 choices // ā§ŠāϝāĻŧ āĻ¸ā§āĻĨāĻžāύ: 4āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ
    5 × 5 × 4 = 100


Formula | āϏāĻšāϜ āϏ⧂āĻ¤ā§ā§°


If 0 is included and repetition is not allowed: (n 1) × (n 1) × (n 2)


Here, n = 6: (6 − 1) × (6 − 1) × (6 − 2) = 5 × 5 × 4 = 100


Ans | āωāĻ¤ā§āϤ⧰ : 100


Note: "0" is included



Q. How many 3-digit numbers can be formed from the digits 2, 3, 5, 8, 9 without repetition ? Q. 2, 3, 5, 8, 9 āϏāĻ‚āĻ–ā§āϝāĻžāĻŦā§‹ā§° āĻĒ⧁āύ⧰āĻžāĻŦ⧃āĻ¤ā§āϤāĻŋ āύāϕ⧰āĻžāĻ•ā§ˆ āĻ•āĻŋāĻŽāĻžāύāϟāĻž 3-āĻ…āĻ‚āϕ⧰ āϏāĻ‚āĻ–ā§āϝāĻž āĻ—āĻ āύ āϕ⧰āĻŋāĻŦ āĻĒāĻžā§°āĻŋ ?


Options | āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ: (A) 120 (B) 90 (C) 60 (D) 50


Trick | āĻŸā§ā§°āĻŋāĻ• : There are 5 digits and 0 is not included. (āĻŽā§āĻ  5āϟāĻž āϏāĻ‚āĻ–ā§āϝāĻž āφāϛ⧇ āφ⧰⧁ 0 āύāĻžāχāĨ¤)



  • 1st place: 5 choices (ā§§āĻŽ āĻ¸ā§āĻĨāĻžāύ: 5āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ) : 

  • 2nd place: 4 choices (⧍āϝāĻŧ āĻ¸ā§āĻĨāĻžāύ: 4āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ) :

  • 3rd place: 3 choices (ā§ŠāϝāĻŧ āĻ¸ā§āĻĨāĻžāύ: 3āϟāĻž āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ) : 


                      5 × 4 × 3 = 60


Formula | āϏ⧂āĻ¤ā§ā§° : If 0 is not included (0 āύāĻžāĻĨāĻžāĻ•āĻŋāϞ⧇): n × (n −1) × (n − 2)


Here, 5 × 4 × 3 = 60


Ans | āωāĻ¤ā§āϤ⧰ : (C) 60



Q. How many numbers between 300 and 700 are divisible by 11 ? Q. 300 āφ⧰⧁ 700ā§° āĻŽāĻžāϜāϤ 11⧰⧇ āĻŦāĻŋāĻ­āĻžāĻœā§āϝ āĻ•āĻŋāĻŽāĻžāύāϟāĻž āϏāĻ‚āĻ–ā§āϝāĻž āφāϛ⧇ ?


Options | āĻŦāĻŋāĻ•āĻ˛ā§āĻĒ: (A) 35 (B) 36 (C) 37 (D) 38


Rule | āϏāĻšāϜ āύāĻŋāϝāĻŧāĻŽ


If both limits are not exactly divisible: (Upper / n) floor − (Lower / n) floor


Here,



 Shortcut| āĻŸā§ā§°āĻŋāĻ•



  • Divide both numbers by the divisor. āĻĻ⧁āϝāĻŧā§‹āϟāĻž āϏāĻ‚āĻ–ā§āϝāĻžāĻ• āĻ­āĻžāϜāϕ⧰⧇ āĻ­āĻžāĻ— āϕ⧰āĻ•āĨ¤

  • Ignore the remainders. āĻ­āĻžāĻ—āĻļ⧇āώāĻ• āωāĻĒ⧇āĻ•ā§āώāĻž āϕ⧰āĻ•āĨ¤

  • Subtract the quotients. āĻ­āĻžāĻ—āĻĢāϞ āĻĻ⧁āϟāĻž āĻŦāĻŋāϝāĻŧā§‹āĻ— āϕ⧰āĻ•āĨ¤


āĻ­āĻžāϜāϕ⧰⧇ āĻĻ⧁āϝāĻŧā§‹āϟāĻž āϏāĻ‚āĻ–ā§āϝāĻžāĻ• āĻ­āĻžāĻ— āϕ⧰āĻ•, āĻ­āĻžāĻ—āĻļ⧇āώ āωāĻĒ⧇āĻ•ā§āώāĻž āϕ⧰āĻ• āφ⧰⧁ āĻ­āĻžāĻ—āĻĢāϞ āĻĻ⧁āϟāĻž āĻŦāĻŋāϝāĻŧā§‹āĻ— āϕ⧰āĻ•āĨ¤



​

🌐