All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Number Count Conclusion (Posted on 2015-04-15)
sod(N) denotes the sum of the base ten digits of N.

N is a 5-digit base ten positive integer divisible by 15, and sod(N) =15

Determine the total count of the values of N for which this is possible.

 No Solution Yet Submitted by K Sengupta Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 Analytics can get you there | Comment 3 of 4 |
As others pointed out, the last digit is 5 or 0.
The first digit is 1,...,9
Together these give 20 possible combinations and all that remains is to get the correct sum for the middle three digits.
For the number of ways to get a given sum of three digits I derived the values but it is also part of https://oeis.org/A213651)

In the chart below the columns go
1st digit
5th digit
Needed sum
Number of ways
`1 0 14 752 0 13 753 0 12 734 0 11 695 0 10 636 0  9 557 0  8 458 0  7 369 0  6 281 5  9 552 5  8 453 5  7 364 5  6 285 5  5 216 5  4 157 5  3 108 5  2  69 5  1  3`

Adding the last column we get 738

 Posted by Jer on 2015-04-16 09:53:17

 Search: Search body:
Forums (0)