Suppose n is an integer such that the sum of the digits of n is 2, and 10^(10) <n<10^(11). The number of different values for n is: A)11 B)10 C)9 D)8

Jonas Bautista

Jonas Bautista

Answered question

2022-12-31

Suppose n is an integer such that the sum of the digits of n is 2, and 10 10 < n < 10 11 . The number of different values for n is: A)11 B)10 C)9 D)8

Answer & Explanation

Cash Osborne

Cash Osborne

Beginner2023-01-01Added 4 answers

The right option is A (11)
Option (a)
There are 11 digits in this number
When sum of digits is 2, there are 2 options
There are 2 ones, with one 1 fixed in the first position
The current query is based on the combination of 10 zeros and 1 one
Number of possibilities = 10!/9!1! = 10 ways
When 2 is the first digit = one possibility.
Entire amount of options = 11

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?