All Exams Test series for 1 year @ ₹349 only
Question

What is the sum of all four digit numbers formed by using all digits \(0, 1, 4, 5\) without repetition of digits?

This question was previously asked in
NDA 2 2024 GAT Question Paper (01-Sep-2024)
The correct answer is
64440

Understanding the Problem: Finding the Sum of 4-Digit Numbers

The question asks us to find the sum of all possible four-digit numbers that can be formed using the digits 0, 1, 4, 5, with the condition that each digit must be used exactly once (no repetition) and the number must be a four-digit number (meaning the first digit cannot be 0).

Key Concepts for Calculation

To solve this, we'll use the principles of permutations and place value.

  • Permutations: We are arranging the given digits. The total number of ways to arrange \(n\) distinct items is \(n!\).
  • Place Value: The value of a digit depends on its position (thousands, hundreds, tens, ones).
  • Constraint: A four-digit number cannot start with 0.

Step-by-Step Calculation

1. Total Possible Arrangements (Permutations)

We have 4 distinct digits: {0, 1, 4, 5}.

The total number of ways to arrange these 4 digits is \(4!\) (4 factorial):

\(4! = 4 \times 3 \times 2 \times 1 = 24\)

This gives us 24 possible arrangements.

2. Arrangements that form Valid 4-Digit Numbers

A four-digit number cannot begin with 0. We need to find how many of the 24 arrangements start with 0.

If 0 is fixed in the first position (thousands place), we need to arrange the remaining 3 digits {1, 4, 5}. The number of ways to do this is \(3!\):

\(3! = 3 \times 2 \times 1 = 6\)

So, there are 6 arrangements that start with 0 (e.g., 0145, 0154, etc.). These are not valid four-digit numbers.

The number of valid four-digit numbers is the total arrangements minus the arrangements starting with 0:

\(\text{Number of valid 4-digit numbers} = 24 - 6 = 18\)

3. Calculating the Sum of All Valid 4-Digit Numbers

We can calculate the sum by considering the contribution of each digit in each place value across all 18 valid numbers.

Method: Sum of all permutations minus sum of permutations starting with 0.

a) Sum of all 24 permutations (treating them as numbers):

Let the sum of the digits be \(S = 0 + 1 + 4 + 5 = 10\).

In the 24 permutations, each digit (0, 1, 4, 5) appears in each place value (thousands, hundreds, tens, ones) an equal number of times. The number of times each digit appears in a specific position is \((4-1)! = 3! = 6\) times.

The sum of all permutations is calculated as:

\(\text{Sum} = S \times (n-1)! \times (1111)\)

Where \(n=4\) (number of digits).

\(\text{Sum}_{\text{all}} = 10 \times 6 \times 1111 = 60 \times 1111 = 66660\)

This sum (66660) includes the values of arrangements starting with 0 (like 0145 treated as 145).

b) Sum of the 6 arrangements starting with 0:

These are permutations where 0 is fixed in the thousands place. The remaining digits {1, 4, 5} form the hundreds, tens, and ones places. The numbers formed are essentially 3-digit numbers using {1, 4, 5}.

The sum of these digits is \(S' = 1 + 4 + 5 = 10\).

There are \(3! = 6\) such numbers.

Each digit (1, 4, 5) appears in the hundreds, tens, and ones places \((3-1)! = 2! = 2\) times.

The sum of these 3-digit numbers is:

\(\text{Sum}_{\text{0-start}} = S' \times (n-1)! \times (111)\)

Where \(n=3\) (for the digits {1, 4, 5}).

\(\text{Sum}_{\text{0-start}} = 10 \times 2 \times 111 = 20 \times 111 = 2220\)

c) Sum of valid 4-Digit Numbers:

To get the sum of only the valid four-digit numbers, we subtract the sum of the numbers starting with 0 from the total sum of all permutations.

\(\text{Sum}_{\text{valid}} = \text{Sum}_{\text{all}} - \text{Sum}_{\text{0-start}}\)

\(\text{Sum}_{\text{valid}} = 66660 - 2220 = 64440\)

Conclusion

The sum of all four-digit numbers formed using the digits 0, 1, 4, 5 without repetition is 64440.

Was this answer helpful?

Similar Questions

  1. Three perfect dice \(D_1, D_2\) and \(D_3\) are rolled. Let \(x, y\) and \(z\) represent the numbers on \(D_1, D_2\) and \(D_3\) respectively. What is the number of possible outcomes such that \(x < y < z\)?
  2. A man has \(7\) relatives (\(4\) women and \(3\) men). His wife also has \(7\) relatives (\(3\) women and \(4\) men). In how many ways can they invite \(3\) women and \(3\) men so that \(3\) of them are man's relatives and \(3\) of them are his wife's relatives?
  3. A triangle \(PQR\) is such that \(3\) points lie on the side \(PQ\), \(4\) points on \(QR\) and \(5\) points on \(RP\) respectively. Triangles are constructed using these points as vertices. What is the number of triangles so formed ?
  4. How many four-digit natural numbers are there such that all of the digits are even?
  5. How many 4-digit numbers are there having all digits as odd?
  6. In how many ways can the letters of the word INDIA be permutated such that in each combination, vowels should occupy odd positions?
  7. The letters of the word EQUATION are arranged in such a way that all vowels as well as consonants are together. How many such arrangements are there?
  8. What is the maximum number of possible points of intersection of four straight lines and a circle (intersection is between lines as well as circle and lines)?
  9. How many sides are there in a polygon which has 20 diagonals?

  10. In how many ways can the letters of the word DELHI be arranged keeping the positions of vowels and consonants unchanged?


Important Questions from Permutation and Combination

  1. On a chess board, in how many different ways can 6 consecutive squares be chosen on the diagonals along a straight path ?

  2. There are 6 persons arranged in a row. Another person has to shake hands with 3 of them so that he should not shake hands with two consecutive persons. In how many distinct possible combinations can the handshakes take place ?

  3. In a tournament of Chess having 150 entrants, a player is eliminated whenever he loses a match. It is given that no match results in a tie/draw. How many matches are played in the entire tournament?

  4. The letters A, B, C, D and E are arranged in such a way that there are exactly two letters between A and E. How many such arrangements are possible?

  5. There is a numeric lock which has a 3-digit PIN. The PIN contains digits 1 to 7. There is no repetition of digits. The digits in the PIN from left to right are in decreasing order. Any two digits in the PIN differ by at least 2. How many maximum attempts does one need to find out the PIN with certainty?

Need Expert Advice?
Test Series
NDA img
Defence
NDA 2026 Mock Test Series (Latest Pattern)
503 Tests 1 Tests Free
1066 Attempts
4.6(137)
English, Hindi

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App