ROSECODE 138
Exploring the Champernowne Constant - Ultimate
C is the Champernowne constant
(See problem 129)
Define K(n) = [C*(10^10^n)] where [x] is the integer part of x // The first 10^n digits of C
Exemple: K(1) = 1234567891
What is the digital sum of the digital sum of K(100)?
You are given:
K(10) = 44567901235
K(15) = 4441049382716054
K(20) = 441486267257142575580
[My timing: < 100ms]
(See problem 129)
Define K(n) = [C*(10^10^n)] where [x] is the integer part of x // The first 10^n digits of C
Exemple: K(1) = 1234567891
What is the digital sum of the digital sum of K(100)?
You are given:
K(10) = 44567901235
K(15) = 4441049382716054
K(20) = 441486267257142575580
[My timing: < 100ms]