Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

How many positive integers less than 1,000,000 have the sum of their digits equal to 19?

Short Answer

Expert verified

There are 30,492 positive integers less than 1,000,000 have the sum of their digits equal to 19

Step by step solution

01

Step 1: Use the formula for integer

Formula for integer

\(C\left( {n + r - 1,r} \right) = \frac{{(n + r - 1)!}}{{n!r!}}\)

n is number of distinguishable boxes

r is number of distinguishable objects

02

Step 2: Solution of number of 19 distinguishable objects

Let’s, applied n and r values of inequality in integer formula

A number less than 1,000,000 will have at most 6 digits.

\({x_1} + {x_2} + {x_3} + {x_4} + {x_5} + {x_6} = 19\)

Ways to select 19 distinguishable objects from 6 distinguishable boxes

\(\begin{array}{l}C\left( {n + r - 1,r} \right) = \frac{{(n + r - 1)!}}{{n!r!}}\\n = 6\\r = 19\\C\left( {n + r - 1,r} \right) = C\left( {6 + 19 - 1,19} \right)\\ = C\left( {24,19} \right)\\ = \frac{{24!}}{{6!19!}}\\ = 42,504\end{array}\)

03

Step 3: Solution of number of 9 distinguishable objects

Let’s, applied n and r values of inequality in integer formula

A number less than 1,000,000 will have at most 6 digits.

\({x_1} + {x_2} + {x_3} + {x_4} + {x_5} + {x_6} = 9\)

Ways to select 9 distinguishable objects from 6 distinguishable boxes

\(\begin{array}{l}C\left( {n + r - 1,r} \right) = \frac{{(n + r - 1)!}}{{n!r!}}\\n = 6\\r = 9\\C\left( {n + r - 1,r} \right) = C\left( {6 + 9 - 1,9} \right)\\ = C\left( {14,9} \right)\\ = \frac{{14!}}{{6!9!}}\\ = 2002\end{array}\)

04

Step 4: Solution of number of sum greater than 19

We can only have 1 Xi because 2Xis will make the sum greater than 19.

Since Xi can take 6 values we multiply 2002 by 6 i.e., 12,012.

So, 42,504 solutions are there without restrictions, but with the restriction

we have only

\(42,504 - 12,012{\rm{ }} = {\rm{ }}30,492\)

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Find the expansion of(x+y)6.

In this exercise we will count the number of paths in the\(xy\)plane between the origin \((0,0)\) and point\((m,n)\), where\(m\)and\(n\)are nonnegative integers, such that each path is made up of a series of steps, where each step is a move one unit to the right or a move one unit upward. (No moves to the left or downward are allowed.) Two such paths from\((0,0)\)to\((5,3)\)are illustrated here.

a) Show that each path of the type described can be represented by a bit string consisting of\(m\,\,0\)s and\(n\,\,1\)s, where a\(0\)represents a move one unit to the right and a\(1\)represents a move one unit upward.

b) Conclude from part (a) that there are \(\left( {\begin{array}{*{20}{c}}{m + n}\\n\end{array}} \right)\) paths of the desired type.

A coin is flipped times where each flip comes up either heads or tails. How many possible outcomes

a) are there in total?

b) contain exactly two heads?

c) contain at most three tails?

d) contain the same number of heads and tails?

a) Explain how to find a formula for the number of ways to select robjects from nobjects when repetition is allowed and order does not matter.

b) How many ways are there to select a dozen objects from among objects of five different types if objects of the same type are indistinguishable?

c) How many ways are there to select a dozen objects from these five different types if there must be at least three objects of the first type?

d) How many ways are there to select a dozen objects from these five different types if there cannot be more than four objects of the first type?

e) How many ways are there to select a dozen objects from these five different types if there must be at least two objects of the first type, but no more than three objects of the second type?

7. How many ways are there to select three unordered elements from a set with five elements when repetition is allowed?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free