Since $10^{999} = 2^{999}5^{999}$ and $10^{998} = 2^{998}5^{998},$ all numbers of the form $2^{m}5^{n}, 0 \le m,n \le 999$ where at least one of $m,n$ equals $999$ will divide $10^{999}$ but not $10^{998}.$

So with $m = 999$ we can have $n$ taking on $1000$ integer values from $0$ to $999.$ The same goes for $n = 999$ with $m$ taking on $1000$ values, but to avoid double-counting we must remember to count $m = n = 999$ only once, resulting in a total of $1000 + 1000 - 1 = 1999$ positive divisors of $10^{999}$ which do not divide $10^{998}.$

@Dev Sharma
–
For this problem addition is the correct operation. Note that $2^{999}5^{999}$ has $(999 + 1)(999 + 1) = 10^{6}$ positive divisors; perhaps that was what you were thinking about. :)

Come to think of it, it's probably easiest to just subtract the number of positive divisors of $10^{998} = 2^{998}5^{998}$ from the number of positive divisors of $10^{999} = 2^{999}5^{999}.$ This gives us an answer of

$</code> ... <code>$</code>...<code>."> Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in $</span> ... <span>$ or $</span> ... <span>$ to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestSince $10^{999} = 2^{999}5^{999}$ and $10^{998} = 2^{998}5^{998},$ all numbers of the form $2^{m}5^{n}, 0 \le m,n \le 999$ where at least one of $m,n$ equals $999$ will divide $10^{999}$ but not $10^{998}.$

So with $m = 999$ we can have $n$ taking on $1000$ integer values from $0$ to $999.$ The same goes for $n = 999$ with $m$ taking on $1000$ values, but to avoid double-counting we must remember to count $m = n = 999$ only once, resulting in a total of $1000 + 1000 - 1 = 1999$ positive divisors of $10^{999}$ which do not divide $10^{998}.$

Log in to reply

Thanks sir.

You are magician.

Log in to reply

A Mathemagician :)

Log in to reply

Log in to reply

Log in to reply

Log in to reply

We have that $(m,n)=(999,0), (999,1), \ldots (999,999), \ldots (1, 999), (0, 999)$ are solutions. To count this, we compute $1000+1000-1=1999$.

Log in to reply

Log in to reply

$2^{999}5^{999}$ has $(999 + 1)(999 + 1) = 10^{6}$ positive divisors; perhaps that was what you were thinking about. :)

For this problem addition is the correct operation. Note thatLog in to reply

Log in to reply

Haha. You're welcome. :)

Log in to reply

your a mathemagician

Log in to reply

Sir, I have one doubt.

I think we should have to multiply 1000 by 1000

Log in to reply

Hm, instead of constructively counting, I wonder if we can find a one to one correspondence.

Log in to reply

Come to think of it, it's probably easiest to just subtract the number of positive divisors of $10^{998} = 2^{998}5^{998}$ from the number of positive divisors of $10^{999} = 2^{999}5^{999}.$ This gives us an answer of

$(999 + 1)(999 + 1) - (998 + 1)(998 + 1) = 1000^{2} - 999^{2} = (1000 - 999)(1000 + 999) = 1999.$

A slightly more involved question would be to find the sum of these $1999$ divisors. I get an answer of

$225*10^{997} - 2^{997} - 5^{999}.$

Log in to reply

1999

Log in to reply