What is this formula?

I was watching avishi mishra's youtube video from a long time ago while she was prepping for IPMAT and saw this formula stuck on her wall. Can someone please explain the formula [sum on all n digits no.s formed using n digits]?

1

Please log in to comment and participate in discussions.

Comments (5)

This formula is used to find the sum of all possible nn-digit numbers that can be formed using a specific set of nn non-zero digits (without repetition).

Sum=(n1)!×(Sum of given digits)×(111...1n times)\text{Sum} = (n-1)! \times (\text{Sum of given digits}) \times (\underbrace{111...1}_{n \text{ times}})

ComponentMeaning
(n1)!(n-1)!The number of times each digit appears in each position (units, tens, hundreds, etc.).
(Sum of digits)(\text{Sum of digits})The sum of the specific numbers you are given to work with.
(111...1)(111...1)The place value factor (e.g., 111111 for a 3-digit number).

Example: Find the sum of all 3-digit numbers formed using digits 1, 2, and 3:

  • n=3n = 3, so (n1)!=2!=2(n-1)! = 2! = \mathbf{2}
  • Sum of digits = 1+2+3=61 + 2 + 3 = \mathbf{6}
  • Place value factor = 111\mathbf{111}

Sum=2×6×111=1,332\text{Sum} = 2 \times 6 \times 111 = \mathbf{1,332}

Note: If a digit is repeated in the given set (e.g., using digits 1, 1, 2), you must divide the final result by the factorial of the number of repetitions (in this case, 2!2!), as noted in the handwritten "divide if digits is repeated" comment.

1

It takes me like 5-6 minutes to write a small latex input. How did you write all of this under a minute....

1

🫳🏻🎤

1

Thank you!

1
What is this formula? | Number System - AfterBoards Forum | AfterBoards