The Champernowne constant is a real number whose digits in decimal representation come from the concatenation of all consecutive positive integers starting from 1.
That is
0.1234567891011121314151617181920...
This constant is of interest because it can be understood to contain an encoding of any past, present or future information, because any given sequence of numbers can be shown to exist somewhere in the champernowne representation.
Return the nth digit of the champernowne constant. The function takes an array of position values and returns an array of digits corresponding to those positions.
Examples:
[1 2 3 4 5] returns [1 2 3 4 5]
[10 11 12 13 14 15] returns [1 0 1 1 1 2]
[188 289] returns [9 9]
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers92
Suggested Problems
-
Find the numeric mean of the prime numbers in a matrix.
9132 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
448 Solvers
-
Determine if input is a perfect number
258 Solvers
-
Flip the vector from right to left
10662 Solvers
-
11283 Solvers
More from this Author10
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Please change the example [188 289] in your problem description to [188 189], as I believe [188 289] should return [9 1], rather than [9 9]. (By the way, great job picking 189 to use for a check. Right at the end of the two-digit numbers.)
uint8 is our friend.