Problem 1477. Champernowne Constant

Created byG K

Like (2)

Solve Later

{“关系”：[{“ RelativeType”：“ http：//schemas.mathworks.com/matlab/matlab/code/2013/relationships/document'“：” /matlab/document.xml“}，{“ RelatessType”：“ http：//schemas.mathworks.com/matlab/matlab/code/2013/relationships/outputs/output”，“ targetMode”，“ targetMode”：“ targetMode”：“：”“ RID2”，“ TARGET”：“/MATLAB/output.xml”}]，“ parts”：[{“ parturi”：“/matlab/document.xml”，“关系”：[]：[]，“ contentType”：“：”：“”application/vnd.mathworks.matlab.code.document+xml“，” content“：” <？xml版本= \“ 1.0 \” encoding = \“ utf-8 \”？> \ n <w：document xmlns：w documn xmlns：w= \“ http：//schemas.openxmlformats.org/wordprocessingml/2006/main \”> <w：body> <w：p> <w：p> <w：ppr> <w：pstyle w：pstyle w：pstyle w：val = \ \ v \ \'> </w：ppr> <w：r> <w：t> </w：t> </w：r> <w：r> <w：t> </w：t> </w：t> </w：r> <w：超链接w：doclocation = \“ http：//en.wikipedia.org/wiki/wiki/champernowne_constant \”> <w：r> <w：r> <w：t> champernowne常数</w：t> </w：t> </w：t> </w：t> </w：r> </w：超链接> <w：r> <w：t>是一个真实数字，其小数表示数字来自所有连续的正整数的串联，从1开始。</w：t> </w：r> </w：p> <w：p> <w：ppr> <w：pstyle w：val = \“ text \”/> </w：ppr> <W：r> <w：t>是</w：t> </w：r> </w：p> <w：p> <w：ppr> <w：pstyle w：pstyle w：val = \“代码\“/> </w：ppr> <w：r> <w：t> <！[cdata [0.123456789111121212121415151617181920 ...]]> </w：t> </w：t> </w：r> </w：r> </w：<w：p> <w：ppr> <w：pstyle w：val = \“ text \”/> </w：ppr> <w：r> <w：t>这个常数很有趣，因为它可以是理解为包含任何过去，现在或将来的信息的编码，因为可以证明任何给定的数字顺序都存在于Champernowne表示中的某个地方。</w：t> </w：r> </w：r> </w：p> <w：p> <w：ppr> <w：pstyle w：val = \“ text \”/> </w：ppr> <w：r> <w：t>返回champernowne常数的nth Digit。该函数采用一个位置值的数组，并返回与这些位置相对应的数字数组。</w：t> </w：r> </w：p> <w：p> <w：p> <w：ppr> <w：pstyle w：val = \“ text \”/> </w：ppr> <w：r> <w：t>示例：</w：t> </w：r> </w：p> <w：p> <w：p> <w：ppr> <w：pstyle w：val = \“代码\”/> </w：ppr> <w：r> <w：t> <！[cdata [[1 2 3 4 5] returns [1 2 3 4 5]\n\n [10 11 12 13 14 15] returns [1 0 1 1 1 2]\n\n [188 289] returns [9 9]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Problem 3) Prev:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"//www.tianjin-qmedu.com/matlabcentral/cody/problems/1472\"><w:r><w:t>1472</w:t></w:r></w:hyperlink><w:r><w:t> Next:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"//www.tianjin-qmedu.com/matlabcentral/cody/problems/1478\"><w:r><w:t>1478</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

The <a href = "http://en.wikipedia.org/wiki/Champernowne_constant">Champernowne constant</a> is a real number whose digits in decimal representation come from the concatenation of all consecutive positive integers starting from 1.That is<pre> 0.1234567891011121314151617181920...</pre>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:<pre> [1 2 3 4 5] returns [1 2 3 4 5]</pre><pre> [10 11 12 13 14 15] returns [1 0 1 1 1 2]</pre><pre> [188 289] returns [9 9] </pre>Problem 3) Prev: <a href = "//www.tianjin-qmedu.com/matlabcentral/cody/problems/1472">1472</a> Next: <a href = "//www.tianjin-qmedu.com/matlabcentral/cody/problems/1478">1478</a>

Solve

Solution Stats

227 Solutions
57 Solvers

LastSolutionsubmitted on May 08, 2022

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Jameson 14 May 2013

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.)

Rafael S.T. Vieiraon 14 Aug 2020

uint8 is our friend.

Problem Recent Solvers57

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1477. Champernowne Constant

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers57

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Problem 1477. Champernowne Constant

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers57

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Players