How far up the number line would you have to go in order for the sum of all individual digits would equal 1,000,000? Example:11 would be 1+1=2, 27 would be 2+7=9, 113 would be 1+1+3=5.....and so on. Thanks for help.

Guest Jul 1, 2018

#1**0 **

well 9 being the highest number to yeild the best results, i would think you would divide,

1000000/9 this would be about 111111, so if you added 111,111 9's that would be 999,999.

then you need a 1 to make it a 1,000,000. put that in front to make it the smallest number possible.

so the answer would be 1999999999... basically 111,111 9's

Guest Jul 1, 2018

#2**0 **

To do this accurately, you would need to write a short computer code to count all the digits and then sum them all up. I just happened to have written such a code a while ago for another question of this nature:

It turns out that you have to add up all the individual digits of all the numbers from **1 to 49,999 **and then would get exactly a total of 1,000,000 as follows:

(18889, 30000, 30000, 30000, 30000, 20000, 20000, 20000, 20000, 20000)=**238,889.**

0s 1s 2s 3s 4s 5s 6s 7s 8s 9s

Then you have =[18,889 x 0 + 30,000 x 1 + 30,000 x 2 + 30,000 x 3 + 30,000 x 4 +20,000 x 5 + 20,000 x 6 + 20,000 x 7 + 20,0000 x 8 + 20,000 x 9] =**1,000,000 Exactly!!!**

Guest Jul 1, 2018

edited by
Guest
Jul 1, 2018

edited by Guest Jul 1, 2018

edited by Guest Jul 1, 2018

#3**0 **

I wrote a program to sum the sizes of my di ck, while looking at old penthouse mags. After a 2 seconds, it says Out of memory. Number too large error.

Guest Jul 1, 2018

#4**0 **

I don't think you have a big di...ck-wishful thinking?- but possibly a big mouth to swallow one!!. Try writing a program for that and publish it!!.

Guest Jul 1, 2018

#5**0 **

I could write one, but I did another test using your_{ di ck size} and it says Out of memory. Number too small error. This proves my program works!!

I used wolfram alpha for mine and it says computational time exceeded.

Guest Jul 1, 2018