Big number puzzleExplain the Magic Numbers!How long can this list of numbers get?Reconstruct this multiplication to find the combination for the safeIt is related to a type of mathematics gameThe Grand Exercise in Following DirectionsNumber Theory Class v2Draw out a Battle!Generating NumbersA magical operationMathematical puzzle: ten digit lock number

Weird corners with cline

How many petaflops does it take to land on the moon? What does Artemis need with an Aitken?

Expanding powers of expressions of the form ax+b

What is the meaning of “these lederhosen are riding up my Bundesliga”?

What is the loud noise of a helicopter when the rotors are not yet moving?

Is it unusual for a math department not to have a mail/web server?

Which old Technic set included large yellow motor?

Is this password scheme legit?

Is it legal for source code containing undefined behavior to crash the compiler?

Disk usage of integer column vs boolean column in Postgres

Given current technology, could TV display screens double as video camera sensors?

Curves with isogenous Jacobians

tcbset behaves differently in preamble and main body

How to prevent a hosting company from accessing a VM's encryption keys?

Is there a word or phrase that means "use other people's wifi or Internet service without consent"?

LINQ for generating all possible permutations

Set orthographic view using python?

What are the IPSE’s, the ASPE’s, the FRIPSE’s and the GRIPSE’s?

What's special ammo in Destiny 2?

Shift lens vs move body?

To what extent should we fear giving offense?

Dealing with stress in coding interviews

1mth baby boy keeps peeing through diapers, sometimes diper seems practically unused

When was the tzitz lost?



Big number puzzle


Explain the Magic Numbers!How long can this list of numbers get?Reconstruct this multiplication to find the combination for the safeIt is related to a type of mathematics gameThe Grand Exercise in Following DirectionsNumber Theory Class v2Draw out a Battle!Generating NumbersA magical operationMathematical puzzle: ten digit lock number






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








6












$begingroup$


I saw this on rec.puzzles many years ago, but can't find the reference to credit the source.



I am thinking of a large number. If you want to multiply it by a two digit number $ab$ with $a lt b$, search through the number for the digits $ba$ in order. Write the part starting at $a$, two zeros, and the part ending with $b$, and you have the product. If you represent the original number as $AbaB$ the product is $aB00Ab$. If you want to multiply by $ab$ with $a gt b$, let $c=a-1$ and look for $ac$. If the number is $AacB$ the product is $cB00Aa$. If you want to multiply it by a multiple of $11$, so $aa$, there are two copies of $aa$ in the number. Do the same as in the previous sentence, but use the one that does not have a $9$ after it in the original number.



What number am I thinking of?










share|improve this question











$endgroup$









  • 1




    $begingroup$
    Wow, nice puzzle! Can we assume that the digits $ab$ for $a neq b$ appear only once?
    $endgroup$
    – athin
    Aug 14 at 7:24






  • 1




    $begingroup$
    Do digits $b$ and $a$ have to be side by side in the big number? Does the "part starting at $a$" includes $a$? The same for $b$. Are there any restrictions as to what $a$ and $b$ can be?
    $endgroup$
    – Ardweaden
    Aug 14 at 7:59







  • 1




    $begingroup$
    Or am I getting this wrong and $ab$ is one specific number?
    $endgroup$
    – Ardweaden
    Aug 14 at 8:14










  • $begingroup$
    Is the essential equation $AbaB times ab = aB00Ab$ where $A$ and $B$ are some strings of digits of unknown length?
    $endgroup$
    – hexomino
    Aug 14 at 11:25











  • $begingroup$
    @hexomino That's my interpretation.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 11:33

















6












$begingroup$


I saw this on rec.puzzles many years ago, but can't find the reference to credit the source.



I am thinking of a large number. If you want to multiply it by a two digit number $ab$ with $a lt b$, search through the number for the digits $ba$ in order. Write the part starting at $a$, two zeros, and the part ending with $b$, and you have the product. If you represent the original number as $AbaB$ the product is $aB00Ab$. If you want to multiply by $ab$ with $a gt b$, let $c=a-1$ and look for $ac$. If the number is $AacB$ the product is $cB00Aa$. If you want to multiply it by a multiple of $11$, so $aa$, there are two copies of $aa$ in the number. Do the same as in the previous sentence, but use the one that does not have a $9$ after it in the original number.



What number am I thinking of?










share|improve this question











$endgroup$









  • 1




    $begingroup$
    Wow, nice puzzle! Can we assume that the digits $ab$ for $a neq b$ appear only once?
    $endgroup$
    – athin
    Aug 14 at 7:24






  • 1




    $begingroup$
    Do digits $b$ and $a$ have to be side by side in the big number? Does the "part starting at $a$" includes $a$? The same for $b$. Are there any restrictions as to what $a$ and $b$ can be?
    $endgroup$
    – Ardweaden
    Aug 14 at 7:59







  • 1




    $begingroup$
    Or am I getting this wrong and $ab$ is one specific number?
    $endgroup$
    – Ardweaden
    Aug 14 at 8:14










  • $begingroup$
    Is the essential equation $AbaB times ab = aB00Ab$ where $A$ and $B$ are some strings of digits of unknown length?
    $endgroup$
    – hexomino
    Aug 14 at 11:25











  • $begingroup$
    @hexomino That's my interpretation.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 11:33













6












6








6





$begingroup$


I saw this on rec.puzzles many years ago, but can't find the reference to credit the source.



I am thinking of a large number. If you want to multiply it by a two digit number $ab$ with $a lt b$, search through the number for the digits $ba$ in order. Write the part starting at $a$, two zeros, and the part ending with $b$, and you have the product. If you represent the original number as $AbaB$ the product is $aB00Ab$. If you want to multiply by $ab$ with $a gt b$, let $c=a-1$ and look for $ac$. If the number is $AacB$ the product is $cB00Aa$. If you want to multiply it by a multiple of $11$, so $aa$, there are two copies of $aa$ in the number. Do the same as in the previous sentence, but use the one that does not have a $9$ after it in the original number.



What number am I thinking of?










share|improve this question











$endgroup$




I saw this on rec.puzzles many years ago, but can't find the reference to credit the source.



I am thinking of a large number. If you want to multiply it by a two digit number $ab$ with $a lt b$, search through the number for the digits $ba$ in order. Write the part starting at $a$, two zeros, and the part ending with $b$, and you have the product. If you represent the original number as $AbaB$ the product is $aB00Ab$. If you want to multiply by $ab$ with $a gt b$, let $c=a-1$ and look for $ac$. If the number is $AacB$ the product is $cB00Aa$. If you want to multiply it by a multiple of $11$, so $aa$, there are two copies of $aa$ in the number. Do the same as in the previous sentence, but use the one that does not have a $9$ after it in the original number.



What number am I thinking of?







mathematics arithmetic algebra






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Aug 15 at 13:50







Ross Millikan

















asked Aug 14 at 3:20









Ross MillikanRoss Millikan

5,98322 silver badges39 bronze badges




5,98322 silver badges39 bronze badges










  • 1




    $begingroup$
    Wow, nice puzzle! Can we assume that the digits $ab$ for $a neq b$ appear only once?
    $endgroup$
    – athin
    Aug 14 at 7:24






  • 1




    $begingroup$
    Do digits $b$ and $a$ have to be side by side in the big number? Does the "part starting at $a$" includes $a$? The same for $b$. Are there any restrictions as to what $a$ and $b$ can be?
    $endgroup$
    – Ardweaden
    Aug 14 at 7:59







  • 1




    $begingroup$
    Or am I getting this wrong and $ab$ is one specific number?
    $endgroup$
    – Ardweaden
    Aug 14 at 8:14










  • $begingroup$
    Is the essential equation $AbaB times ab = aB00Ab$ where $A$ and $B$ are some strings of digits of unknown length?
    $endgroup$
    – hexomino
    Aug 14 at 11:25











  • $begingroup$
    @hexomino That's my interpretation.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 11:33












  • 1




    $begingroup$
    Wow, nice puzzle! Can we assume that the digits $ab$ for $a neq b$ appear only once?
    $endgroup$
    – athin
    Aug 14 at 7:24






  • 1




    $begingroup$
    Do digits $b$ and $a$ have to be side by side in the big number? Does the "part starting at $a$" includes $a$? The same for $b$. Are there any restrictions as to what $a$ and $b$ can be?
    $endgroup$
    – Ardweaden
    Aug 14 at 7:59







  • 1




    $begingroup$
    Or am I getting this wrong and $ab$ is one specific number?
    $endgroup$
    – Ardweaden
    Aug 14 at 8:14










  • $begingroup$
    Is the essential equation $AbaB times ab = aB00Ab$ where $A$ and $B$ are some strings of digits of unknown length?
    $endgroup$
    – hexomino
    Aug 14 at 11:25











  • $begingroup$
    @hexomino That's my interpretation.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 11:33







1




1




$begingroup$
Wow, nice puzzle! Can we assume that the digits $ab$ for $a neq b$ appear only once?
$endgroup$
– athin
Aug 14 at 7:24




$begingroup$
Wow, nice puzzle! Can we assume that the digits $ab$ for $a neq b$ appear only once?
$endgroup$
– athin
Aug 14 at 7:24




1




1




$begingroup$
Do digits $b$ and $a$ have to be side by side in the big number? Does the "part starting at $a$" includes $a$? The same for $b$. Are there any restrictions as to what $a$ and $b$ can be?
$endgroup$
– Ardweaden
Aug 14 at 7:59





$begingroup$
Do digits $b$ and $a$ have to be side by side in the big number? Does the "part starting at $a$" includes $a$? The same for $b$. Are there any restrictions as to what $a$ and $b$ can be?
$endgroup$
– Ardweaden
Aug 14 at 7:59





1




1




$begingroup$
Or am I getting this wrong and $ab$ is one specific number?
$endgroup$
– Ardweaden
Aug 14 at 8:14




$begingroup$
Or am I getting this wrong and $ab$ is one specific number?
$endgroup$
– Ardweaden
Aug 14 at 8:14












$begingroup$
Is the essential equation $AbaB times ab = aB00Ab$ where $A$ and $B$ are some strings of digits of unknown length?
$endgroup$
– hexomino
Aug 14 at 11:25





$begingroup$
Is the essential equation $AbaB times ab = aB00Ab$ where $A$ and $B$ are some strings of digits of unknown length?
$endgroup$
– hexomino
Aug 14 at 11:25













$begingroup$
@hexomino That's my interpretation.
$endgroup$
– Arnaud Mortier
Aug 14 at 11:33




$begingroup$
@hexomino That's my interpretation.
$endgroup$
– Arnaud Mortier
Aug 14 at 11:33










2 Answers
2






active

oldest

votes


















11













$begingroup$

And here is the number you are probably thinking of:




$(10^108-1)/109$ =
9174311926605504587155963302752293577981651376146788990825688073394495412844036697247706422018348623853211




It works only for $ab$ where $a le b$. I suppose that it is a mistake in the problem statement. Others have proven that as it is, the problem is unsolvable.



And here is how I came to that number.




This behaviour of the multiples being a rotation of the original number occurs when the number is the recurrent part of the decimal expansion of some 1/N.


For example for N=7, 1/N = 0.142857142857... . The recurrent part is 142857. The multiples of 142857 are 142857, 285714, 428571, 571428, 714285, 857142 and 999999.


The additional 00 to add is because 1/N actually starts with 0.009174... The zeroes are stripped in the original number, but must be restored in every rotation of the number. The fact that the recurrent part starts with 00 tells me that N is betwen 100 and 999.


The recurrent part of $1/N$ for a large N is of the form $(10^R-1)/N$ where R is the period of the decimal expansion, or the length of the recurrent part. So I checked only numbers of that form.


The number of digits should have been 100 to accomodate with all the combinations of $ab$ once from 10 to 99, plus a second copy of $aa$'s from 11 to 99, plus 1 because the first and last digits can match only once. The actual length is 106. Since cases with $a<b$ are not counted, it actually could be anywhere from 46 and larger. Anyway I tried all lengths up to 120.


So I searched for numbers of the form $(10^R-1)/N$ that contain all combination of 2 digits $ab$. I didn't find any so I ignored the case $b=0$. I found a few candidates. But checking for which $ab$ the multiplication procedure actually works, I noticed that it works only when $a le b$. Since other have proven that the problem is not possible as stated, I assume it is a mistake, maybe the procedure for $a>b$ is different than for $a>b$.




PS: I have been playing with this problem. You can extend it to $ab$ with $a > b$ with the following rule:



  • if a = b+1 then search $bb9$ and split between the b's.

  • if a > b+1 then search $b(a-1)$ and split between b and (a-1).

For example, to multiply by 42 don't search for 24 but 23 and split the number between 2 and 3. For the search with 0's you might need to imagine the '00' in front.






share|improve this answer











$endgroup$














  • $begingroup$
    geq will produce $geq$. Also, how did you come up with this number, and with "the" (?) way to fix the statement?
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:20










  • $begingroup$
    This does seem to be a very interesting number! It does seem that multiplying it by $ab$ with $a geq b$ gives you some cyclic permutation of the digits with two 0s included but I don't see how it matches the question description. Could you expand a bit more, please?
    $endgroup$
    – hexomino
    Aug 14 at 12:29










  • $begingroup$
    @ArnaudMortier I've googled around a bit and it looks like this is the periodic part of $frac1109$ and is the 10th cyclic number (in decimal). This means that cyclic permutations of the number (including two 0s at the beginning) are multiples of it.
    $endgroup$
    – hexomino
    Aug 14 at 12:37










  • $begingroup$
    @hexomino I was doing the same :) it would still be interesting to see a natural way to come up with this number.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:41










  • $begingroup$
    Multiplying by ab with a<b also gives a rotation of the number, it is only the method to find where to split the number that fails.
    $endgroup$
    – Florian F
    Aug 14 at 13:20


















7













$begingroup$

I am going to prove that




such a number cannot exist, because for any $a$ there has to be more than one instance of $aa$ not followed by a $9$. The proof relies on the condition that for every digit $a$, there are exactly two instances of $aa$ in the number. Note that the number found by @FlorianF fails to meet this criterion (there is only one $99$).




Indeed




There is $999$ somewhere in $X$, and no other $99$'s. Indeed, we know that there are only two $99$ sequences, and one of them is followed by a $9$.


Now let us multiply $X$ by $99$. Since there is $colorred999$ in $X$, $99times X$ ends with $colorred99$ and therefore $X$ ends with $01$. This is because the last two digits of $99times x$ are always equal to $100$ minus the last two digits of $x$.


Now because of this, the product of $X$ by $aa$ for arbitrary $a$ ends with $aa$, and this gives us that for every digit $a$, the sequence $aa$ not followed by a $9$ has to be preceded by yet another $a$, which makes it $aaa(textsome digitneq 9)$, which proves the claim.





Let me dump here previous thoughts that turned out not to be useful but might be in the future.



First,




$X$ ends with $1$.

Indeed, by Rule #1 the product $Xtimes(ab)$ always ends with the digit $b$.




Second




$X$ begins with $9$ (followed either by a non-zero digit, or by $09$ and then a non-zero digit).

This is because $11times X$ has two more digits than $X$. The smallest such number (with any fixed number of digits) is $909090...$ but there can't be more than one instance of $09$ in $X$, hence the precision in parentheses.







share|improve this answer











$endgroup$














  • $begingroup$
    I arrived at the same conclusion as you by a different route. It seems something is probably wrong with the statement of the problem...
    $endgroup$
    – Gareth McCaughan
    Aug 14 at 12:03










  • $begingroup$
    @GarethMcCaughan Indeed, if this is not the intended answer, since the OP does not have the original reference it will be hard to feel around for the correct statement.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:06










  • $begingroup$
    @ArnaudMortier Apologies my interpretation was that there be just one instance of $ab$ but I'll admit the wording seems to support your interpretation. Does this mean that, a priori, $X$ must contain every possible substring of two digits?
    $endgroup$
    – hexomino
    Aug 14 at 12:13










  • $begingroup$
    @hexomino Yes, that's how I interpret it.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:16













Your Answer








StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "559"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f87074%2fbig-number-puzzle%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









11













$begingroup$

And here is the number you are probably thinking of:




$(10^108-1)/109$ =
9174311926605504587155963302752293577981651376146788990825688073394495412844036697247706422018348623853211




It works only for $ab$ where $a le b$. I suppose that it is a mistake in the problem statement. Others have proven that as it is, the problem is unsolvable.



And here is how I came to that number.




This behaviour of the multiples being a rotation of the original number occurs when the number is the recurrent part of the decimal expansion of some 1/N.


For example for N=7, 1/N = 0.142857142857... . The recurrent part is 142857. The multiples of 142857 are 142857, 285714, 428571, 571428, 714285, 857142 and 999999.


The additional 00 to add is because 1/N actually starts with 0.009174... The zeroes are stripped in the original number, but must be restored in every rotation of the number. The fact that the recurrent part starts with 00 tells me that N is betwen 100 and 999.


The recurrent part of $1/N$ for a large N is of the form $(10^R-1)/N$ where R is the period of the decimal expansion, or the length of the recurrent part. So I checked only numbers of that form.


The number of digits should have been 100 to accomodate with all the combinations of $ab$ once from 10 to 99, plus a second copy of $aa$'s from 11 to 99, plus 1 because the first and last digits can match only once. The actual length is 106. Since cases with $a<b$ are not counted, it actually could be anywhere from 46 and larger. Anyway I tried all lengths up to 120.


So I searched for numbers of the form $(10^R-1)/N$ that contain all combination of 2 digits $ab$. I didn't find any so I ignored the case $b=0$. I found a few candidates. But checking for which $ab$ the multiplication procedure actually works, I noticed that it works only when $a le b$. Since other have proven that the problem is not possible as stated, I assume it is a mistake, maybe the procedure for $a>b$ is different than for $a>b$.




PS: I have been playing with this problem. You can extend it to $ab$ with $a > b$ with the following rule:



  • if a = b+1 then search $bb9$ and split between the b's.

  • if a > b+1 then search $b(a-1)$ and split between b and (a-1).

For example, to multiply by 42 don't search for 24 but 23 and split the number between 2 and 3. For the search with 0's you might need to imagine the '00' in front.






share|improve this answer











$endgroup$














  • $begingroup$
    geq will produce $geq$. Also, how did you come up with this number, and with "the" (?) way to fix the statement?
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:20










  • $begingroup$
    This does seem to be a very interesting number! It does seem that multiplying it by $ab$ with $a geq b$ gives you some cyclic permutation of the digits with two 0s included but I don't see how it matches the question description. Could you expand a bit more, please?
    $endgroup$
    – hexomino
    Aug 14 at 12:29










  • $begingroup$
    @ArnaudMortier I've googled around a bit and it looks like this is the periodic part of $frac1109$ and is the 10th cyclic number (in decimal). This means that cyclic permutations of the number (including two 0s at the beginning) are multiples of it.
    $endgroup$
    – hexomino
    Aug 14 at 12:37










  • $begingroup$
    @hexomino I was doing the same :) it would still be interesting to see a natural way to come up with this number.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:41










  • $begingroup$
    Multiplying by ab with a<b also gives a rotation of the number, it is only the method to find where to split the number that fails.
    $endgroup$
    – Florian F
    Aug 14 at 13:20















11













$begingroup$

And here is the number you are probably thinking of:




$(10^108-1)/109$ =
9174311926605504587155963302752293577981651376146788990825688073394495412844036697247706422018348623853211




It works only for $ab$ where $a le b$. I suppose that it is a mistake in the problem statement. Others have proven that as it is, the problem is unsolvable.



And here is how I came to that number.




This behaviour of the multiples being a rotation of the original number occurs when the number is the recurrent part of the decimal expansion of some 1/N.


For example for N=7, 1/N = 0.142857142857... . The recurrent part is 142857. The multiples of 142857 are 142857, 285714, 428571, 571428, 714285, 857142 and 999999.


The additional 00 to add is because 1/N actually starts with 0.009174... The zeroes are stripped in the original number, but must be restored in every rotation of the number. The fact that the recurrent part starts with 00 tells me that N is betwen 100 and 999.


The recurrent part of $1/N$ for a large N is of the form $(10^R-1)/N$ where R is the period of the decimal expansion, or the length of the recurrent part. So I checked only numbers of that form.


The number of digits should have been 100 to accomodate with all the combinations of $ab$ once from 10 to 99, plus a second copy of $aa$'s from 11 to 99, plus 1 because the first and last digits can match only once. The actual length is 106. Since cases with $a<b$ are not counted, it actually could be anywhere from 46 and larger. Anyway I tried all lengths up to 120.


So I searched for numbers of the form $(10^R-1)/N$ that contain all combination of 2 digits $ab$. I didn't find any so I ignored the case $b=0$. I found a few candidates. But checking for which $ab$ the multiplication procedure actually works, I noticed that it works only when $a le b$. Since other have proven that the problem is not possible as stated, I assume it is a mistake, maybe the procedure for $a>b$ is different than for $a>b$.




PS: I have been playing with this problem. You can extend it to $ab$ with $a > b$ with the following rule:



  • if a = b+1 then search $bb9$ and split between the b's.

  • if a > b+1 then search $b(a-1)$ and split between b and (a-1).

For example, to multiply by 42 don't search for 24 but 23 and split the number between 2 and 3. For the search with 0's you might need to imagine the '00' in front.






share|improve this answer











$endgroup$














  • $begingroup$
    geq will produce $geq$. Also, how did you come up with this number, and with "the" (?) way to fix the statement?
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:20










  • $begingroup$
    This does seem to be a very interesting number! It does seem that multiplying it by $ab$ with $a geq b$ gives you some cyclic permutation of the digits with two 0s included but I don't see how it matches the question description. Could you expand a bit more, please?
    $endgroup$
    – hexomino
    Aug 14 at 12:29










  • $begingroup$
    @ArnaudMortier I've googled around a bit and it looks like this is the periodic part of $frac1109$ and is the 10th cyclic number (in decimal). This means that cyclic permutations of the number (including two 0s at the beginning) are multiples of it.
    $endgroup$
    – hexomino
    Aug 14 at 12:37










  • $begingroup$
    @hexomino I was doing the same :) it would still be interesting to see a natural way to come up with this number.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:41










  • $begingroup$
    Multiplying by ab with a<b also gives a rotation of the number, it is only the method to find where to split the number that fails.
    $endgroup$
    – Florian F
    Aug 14 at 13:20













11














11










11







$begingroup$

And here is the number you are probably thinking of:




$(10^108-1)/109$ =
9174311926605504587155963302752293577981651376146788990825688073394495412844036697247706422018348623853211




It works only for $ab$ where $a le b$. I suppose that it is a mistake in the problem statement. Others have proven that as it is, the problem is unsolvable.



And here is how I came to that number.




This behaviour of the multiples being a rotation of the original number occurs when the number is the recurrent part of the decimal expansion of some 1/N.


For example for N=7, 1/N = 0.142857142857... . The recurrent part is 142857. The multiples of 142857 are 142857, 285714, 428571, 571428, 714285, 857142 and 999999.


The additional 00 to add is because 1/N actually starts with 0.009174... The zeroes are stripped in the original number, but must be restored in every rotation of the number. The fact that the recurrent part starts with 00 tells me that N is betwen 100 and 999.


The recurrent part of $1/N$ for a large N is of the form $(10^R-1)/N$ where R is the period of the decimal expansion, or the length of the recurrent part. So I checked only numbers of that form.


The number of digits should have been 100 to accomodate with all the combinations of $ab$ once from 10 to 99, plus a second copy of $aa$'s from 11 to 99, plus 1 because the first and last digits can match only once. The actual length is 106. Since cases with $a<b$ are not counted, it actually could be anywhere from 46 and larger. Anyway I tried all lengths up to 120.


So I searched for numbers of the form $(10^R-1)/N$ that contain all combination of 2 digits $ab$. I didn't find any so I ignored the case $b=0$. I found a few candidates. But checking for which $ab$ the multiplication procedure actually works, I noticed that it works only when $a le b$. Since other have proven that the problem is not possible as stated, I assume it is a mistake, maybe the procedure for $a>b$ is different than for $a>b$.




PS: I have been playing with this problem. You can extend it to $ab$ with $a > b$ with the following rule:



  • if a = b+1 then search $bb9$ and split between the b's.

  • if a > b+1 then search $b(a-1)$ and split between b and (a-1).

For example, to multiply by 42 don't search for 24 but 23 and split the number between 2 and 3. For the search with 0's you might need to imagine the '00' in front.






share|improve this answer











$endgroup$



And here is the number you are probably thinking of:




$(10^108-1)/109$ =
9174311926605504587155963302752293577981651376146788990825688073394495412844036697247706422018348623853211




It works only for $ab$ where $a le b$. I suppose that it is a mistake in the problem statement. Others have proven that as it is, the problem is unsolvable.



And here is how I came to that number.




This behaviour of the multiples being a rotation of the original number occurs when the number is the recurrent part of the decimal expansion of some 1/N.


For example for N=7, 1/N = 0.142857142857... . The recurrent part is 142857. The multiples of 142857 are 142857, 285714, 428571, 571428, 714285, 857142 and 999999.


The additional 00 to add is because 1/N actually starts with 0.009174... The zeroes are stripped in the original number, but must be restored in every rotation of the number. The fact that the recurrent part starts with 00 tells me that N is betwen 100 and 999.


The recurrent part of $1/N$ for a large N is of the form $(10^R-1)/N$ where R is the period of the decimal expansion, or the length of the recurrent part. So I checked only numbers of that form.


The number of digits should have been 100 to accomodate with all the combinations of $ab$ once from 10 to 99, plus a second copy of $aa$'s from 11 to 99, plus 1 because the first and last digits can match only once. The actual length is 106. Since cases with $a<b$ are not counted, it actually could be anywhere from 46 and larger. Anyway I tried all lengths up to 120.


So I searched for numbers of the form $(10^R-1)/N$ that contain all combination of 2 digits $ab$. I didn't find any so I ignored the case $b=0$. I found a few candidates. But checking for which $ab$ the multiplication procedure actually works, I noticed that it works only when $a le b$. Since other have proven that the problem is not possible as stated, I assume it is a mistake, maybe the procedure for $a>b$ is different than for $a>b$.




PS: I have been playing with this problem. You can extend it to $ab$ with $a > b$ with the following rule:



  • if a = b+1 then search $bb9$ and split between the b's.

  • if a > b+1 then search $b(a-1)$ and split between b and (a-1).

For example, to multiply by 42 don't search for 24 but 23 and split the number between 2 and 3. For the search with 0's you might need to imagine the '00' in front.







share|improve this answer














share|improve this answer



share|improve this answer








edited Aug 14 at 16:21

























answered Aug 14 at 12:18









Florian FFlorian F

10.5k2 gold badges26 silver badges65 bronze badges




10.5k2 gold badges26 silver badges65 bronze badges














  • $begingroup$
    geq will produce $geq$. Also, how did you come up with this number, and with "the" (?) way to fix the statement?
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:20










  • $begingroup$
    This does seem to be a very interesting number! It does seem that multiplying it by $ab$ with $a geq b$ gives you some cyclic permutation of the digits with two 0s included but I don't see how it matches the question description. Could you expand a bit more, please?
    $endgroup$
    – hexomino
    Aug 14 at 12:29










  • $begingroup$
    @ArnaudMortier I've googled around a bit and it looks like this is the periodic part of $frac1109$ and is the 10th cyclic number (in decimal). This means that cyclic permutations of the number (including two 0s at the beginning) are multiples of it.
    $endgroup$
    – hexomino
    Aug 14 at 12:37










  • $begingroup$
    @hexomino I was doing the same :) it would still be interesting to see a natural way to come up with this number.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:41










  • $begingroup$
    Multiplying by ab with a<b also gives a rotation of the number, it is only the method to find where to split the number that fails.
    $endgroup$
    – Florian F
    Aug 14 at 13:20
















  • $begingroup$
    geq will produce $geq$. Also, how did you come up with this number, and with "the" (?) way to fix the statement?
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:20










  • $begingroup$
    This does seem to be a very interesting number! It does seem that multiplying it by $ab$ with $a geq b$ gives you some cyclic permutation of the digits with two 0s included but I don't see how it matches the question description. Could you expand a bit more, please?
    $endgroup$
    – hexomino
    Aug 14 at 12:29










  • $begingroup$
    @ArnaudMortier I've googled around a bit and it looks like this is the periodic part of $frac1109$ and is the 10th cyclic number (in decimal). This means that cyclic permutations of the number (including two 0s at the beginning) are multiples of it.
    $endgroup$
    – hexomino
    Aug 14 at 12:37










  • $begingroup$
    @hexomino I was doing the same :) it would still be interesting to see a natural way to come up with this number.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:41










  • $begingroup$
    Multiplying by ab with a<b also gives a rotation of the number, it is only the method to find where to split the number that fails.
    $endgroup$
    – Florian F
    Aug 14 at 13:20















$begingroup$
geq will produce $geq$. Also, how did you come up with this number, and with "the" (?) way to fix the statement?
$endgroup$
– Arnaud Mortier
Aug 14 at 12:20




$begingroup$
geq will produce $geq$. Also, how did you come up with this number, and with "the" (?) way to fix the statement?
$endgroup$
– Arnaud Mortier
Aug 14 at 12:20












$begingroup$
This does seem to be a very interesting number! It does seem that multiplying it by $ab$ with $a geq b$ gives you some cyclic permutation of the digits with two 0s included but I don't see how it matches the question description. Could you expand a bit more, please?
$endgroup$
– hexomino
Aug 14 at 12:29




$begingroup$
This does seem to be a very interesting number! It does seem that multiplying it by $ab$ with $a geq b$ gives you some cyclic permutation of the digits with two 0s included but I don't see how it matches the question description. Could you expand a bit more, please?
$endgroup$
– hexomino
Aug 14 at 12:29












$begingroup$
@ArnaudMortier I've googled around a bit and it looks like this is the periodic part of $frac1109$ and is the 10th cyclic number (in decimal). This means that cyclic permutations of the number (including two 0s at the beginning) are multiples of it.
$endgroup$
– hexomino
Aug 14 at 12:37




$begingroup$
@ArnaudMortier I've googled around a bit and it looks like this is the periodic part of $frac1109$ and is the 10th cyclic number (in decimal). This means that cyclic permutations of the number (including two 0s at the beginning) are multiples of it.
$endgroup$
– hexomino
Aug 14 at 12:37












$begingroup$
@hexomino I was doing the same :) it would still be interesting to see a natural way to come up with this number.
$endgroup$
– Arnaud Mortier
Aug 14 at 12:41




$begingroup$
@hexomino I was doing the same :) it would still be interesting to see a natural way to come up with this number.
$endgroup$
– Arnaud Mortier
Aug 14 at 12:41












$begingroup$
Multiplying by ab with a<b also gives a rotation of the number, it is only the method to find where to split the number that fails.
$endgroup$
– Florian F
Aug 14 at 13:20




$begingroup$
Multiplying by ab with a<b also gives a rotation of the number, it is only the method to find where to split the number that fails.
$endgroup$
– Florian F
Aug 14 at 13:20













7













$begingroup$

I am going to prove that




such a number cannot exist, because for any $a$ there has to be more than one instance of $aa$ not followed by a $9$. The proof relies on the condition that for every digit $a$, there are exactly two instances of $aa$ in the number. Note that the number found by @FlorianF fails to meet this criterion (there is only one $99$).




Indeed




There is $999$ somewhere in $X$, and no other $99$'s. Indeed, we know that there are only two $99$ sequences, and one of them is followed by a $9$.


Now let us multiply $X$ by $99$. Since there is $colorred999$ in $X$, $99times X$ ends with $colorred99$ and therefore $X$ ends with $01$. This is because the last two digits of $99times x$ are always equal to $100$ minus the last two digits of $x$.


Now because of this, the product of $X$ by $aa$ for arbitrary $a$ ends with $aa$, and this gives us that for every digit $a$, the sequence $aa$ not followed by a $9$ has to be preceded by yet another $a$, which makes it $aaa(textsome digitneq 9)$, which proves the claim.





Let me dump here previous thoughts that turned out not to be useful but might be in the future.



First,




$X$ ends with $1$.

Indeed, by Rule #1 the product $Xtimes(ab)$ always ends with the digit $b$.




Second




$X$ begins with $9$ (followed either by a non-zero digit, or by $09$ and then a non-zero digit).

This is because $11times X$ has two more digits than $X$. The smallest such number (with any fixed number of digits) is $909090...$ but there can't be more than one instance of $09$ in $X$, hence the precision in parentheses.







share|improve this answer











$endgroup$














  • $begingroup$
    I arrived at the same conclusion as you by a different route. It seems something is probably wrong with the statement of the problem...
    $endgroup$
    – Gareth McCaughan
    Aug 14 at 12:03










  • $begingroup$
    @GarethMcCaughan Indeed, if this is not the intended answer, since the OP does not have the original reference it will be hard to feel around for the correct statement.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:06










  • $begingroup$
    @ArnaudMortier Apologies my interpretation was that there be just one instance of $ab$ but I'll admit the wording seems to support your interpretation. Does this mean that, a priori, $X$ must contain every possible substring of two digits?
    $endgroup$
    – hexomino
    Aug 14 at 12:13










  • $begingroup$
    @hexomino Yes, that's how I interpret it.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:16















7













$begingroup$

I am going to prove that




such a number cannot exist, because for any $a$ there has to be more than one instance of $aa$ not followed by a $9$. The proof relies on the condition that for every digit $a$, there are exactly two instances of $aa$ in the number. Note that the number found by @FlorianF fails to meet this criterion (there is only one $99$).




Indeed




There is $999$ somewhere in $X$, and no other $99$'s. Indeed, we know that there are only two $99$ sequences, and one of them is followed by a $9$.


Now let us multiply $X$ by $99$. Since there is $colorred999$ in $X$, $99times X$ ends with $colorred99$ and therefore $X$ ends with $01$. This is because the last two digits of $99times x$ are always equal to $100$ minus the last two digits of $x$.


Now because of this, the product of $X$ by $aa$ for arbitrary $a$ ends with $aa$, and this gives us that for every digit $a$, the sequence $aa$ not followed by a $9$ has to be preceded by yet another $a$, which makes it $aaa(textsome digitneq 9)$, which proves the claim.





Let me dump here previous thoughts that turned out not to be useful but might be in the future.



First,




$X$ ends with $1$.

Indeed, by Rule #1 the product $Xtimes(ab)$ always ends with the digit $b$.




Second




$X$ begins with $9$ (followed either by a non-zero digit, or by $09$ and then a non-zero digit).

This is because $11times X$ has two more digits than $X$. The smallest such number (with any fixed number of digits) is $909090...$ but there can't be more than one instance of $09$ in $X$, hence the precision in parentheses.







share|improve this answer











$endgroup$














  • $begingroup$
    I arrived at the same conclusion as you by a different route. It seems something is probably wrong with the statement of the problem...
    $endgroup$
    – Gareth McCaughan
    Aug 14 at 12:03










  • $begingroup$
    @GarethMcCaughan Indeed, if this is not the intended answer, since the OP does not have the original reference it will be hard to feel around for the correct statement.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:06










  • $begingroup$
    @ArnaudMortier Apologies my interpretation was that there be just one instance of $ab$ but I'll admit the wording seems to support your interpretation. Does this mean that, a priori, $X$ must contain every possible substring of two digits?
    $endgroup$
    – hexomino
    Aug 14 at 12:13










  • $begingroup$
    @hexomino Yes, that's how I interpret it.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:16













7














7










7







$begingroup$

I am going to prove that




such a number cannot exist, because for any $a$ there has to be more than one instance of $aa$ not followed by a $9$. The proof relies on the condition that for every digit $a$, there are exactly two instances of $aa$ in the number. Note that the number found by @FlorianF fails to meet this criterion (there is only one $99$).




Indeed




There is $999$ somewhere in $X$, and no other $99$'s. Indeed, we know that there are only two $99$ sequences, and one of them is followed by a $9$.


Now let us multiply $X$ by $99$. Since there is $colorred999$ in $X$, $99times X$ ends with $colorred99$ and therefore $X$ ends with $01$. This is because the last two digits of $99times x$ are always equal to $100$ minus the last two digits of $x$.


Now because of this, the product of $X$ by $aa$ for arbitrary $a$ ends with $aa$, and this gives us that for every digit $a$, the sequence $aa$ not followed by a $9$ has to be preceded by yet another $a$, which makes it $aaa(textsome digitneq 9)$, which proves the claim.





Let me dump here previous thoughts that turned out not to be useful but might be in the future.



First,




$X$ ends with $1$.

Indeed, by Rule #1 the product $Xtimes(ab)$ always ends with the digit $b$.




Second




$X$ begins with $9$ (followed either by a non-zero digit, or by $09$ and then a non-zero digit).

This is because $11times X$ has two more digits than $X$. The smallest such number (with any fixed number of digits) is $909090...$ but there can't be more than one instance of $09$ in $X$, hence the precision in parentheses.







share|improve this answer











$endgroup$



I am going to prove that




such a number cannot exist, because for any $a$ there has to be more than one instance of $aa$ not followed by a $9$. The proof relies on the condition that for every digit $a$, there are exactly two instances of $aa$ in the number. Note that the number found by @FlorianF fails to meet this criterion (there is only one $99$).




Indeed




There is $999$ somewhere in $X$, and no other $99$'s. Indeed, we know that there are only two $99$ sequences, and one of them is followed by a $9$.


Now let us multiply $X$ by $99$. Since there is $colorred999$ in $X$, $99times X$ ends with $colorred99$ and therefore $X$ ends with $01$. This is because the last two digits of $99times x$ are always equal to $100$ minus the last two digits of $x$.


Now because of this, the product of $X$ by $aa$ for arbitrary $a$ ends with $aa$, and this gives us that for every digit $a$, the sequence $aa$ not followed by a $9$ has to be preceded by yet another $a$, which makes it $aaa(textsome digitneq 9)$, which proves the claim.





Let me dump here previous thoughts that turned out not to be useful but might be in the future.



First,




$X$ ends with $1$.

Indeed, by Rule #1 the product $Xtimes(ab)$ always ends with the digit $b$.




Second




$X$ begins with $9$ (followed either by a non-zero digit, or by $09$ and then a non-zero digit).

This is because $11times X$ has two more digits than $X$. The smallest such number (with any fixed number of digits) is $909090...$ but there can't be more than one instance of $09$ in $X$, hence the precision in parentheses.








share|improve this answer














share|improve this answer



share|improve this answer








edited Aug 14 at 17:32

























answered Aug 14 at 11:56









Arnaud MortierArnaud Mortier

5,15713 silver badges45 bronze badges




5,15713 silver badges45 bronze badges














  • $begingroup$
    I arrived at the same conclusion as you by a different route. It seems something is probably wrong with the statement of the problem...
    $endgroup$
    – Gareth McCaughan
    Aug 14 at 12:03










  • $begingroup$
    @GarethMcCaughan Indeed, if this is not the intended answer, since the OP does not have the original reference it will be hard to feel around for the correct statement.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:06










  • $begingroup$
    @ArnaudMortier Apologies my interpretation was that there be just one instance of $ab$ but I'll admit the wording seems to support your interpretation. Does this mean that, a priori, $X$ must contain every possible substring of two digits?
    $endgroup$
    – hexomino
    Aug 14 at 12:13










  • $begingroup$
    @hexomino Yes, that's how I interpret it.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:16
















  • $begingroup$
    I arrived at the same conclusion as you by a different route. It seems something is probably wrong with the statement of the problem...
    $endgroup$
    – Gareth McCaughan
    Aug 14 at 12:03










  • $begingroup$
    @GarethMcCaughan Indeed, if this is not the intended answer, since the OP does not have the original reference it will be hard to feel around for the correct statement.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:06










  • $begingroup$
    @ArnaudMortier Apologies my interpretation was that there be just one instance of $ab$ but I'll admit the wording seems to support your interpretation. Does this mean that, a priori, $X$ must contain every possible substring of two digits?
    $endgroup$
    – hexomino
    Aug 14 at 12:13










  • $begingroup$
    @hexomino Yes, that's how I interpret it.
    $endgroup$
    – Arnaud Mortier
    Aug 14 at 12:16















$begingroup$
I arrived at the same conclusion as you by a different route. It seems something is probably wrong with the statement of the problem...
$endgroup$
– Gareth McCaughan
Aug 14 at 12:03




$begingroup$
I arrived at the same conclusion as you by a different route. It seems something is probably wrong with the statement of the problem...
$endgroup$
– Gareth McCaughan
Aug 14 at 12:03












$begingroup$
@GarethMcCaughan Indeed, if this is not the intended answer, since the OP does not have the original reference it will be hard to feel around for the correct statement.
$endgroup$
– Arnaud Mortier
Aug 14 at 12:06




$begingroup$
@GarethMcCaughan Indeed, if this is not the intended answer, since the OP does not have the original reference it will be hard to feel around for the correct statement.
$endgroup$
– Arnaud Mortier
Aug 14 at 12:06












$begingroup$
@ArnaudMortier Apologies my interpretation was that there be just one instance of $ab$ but I'll admit the wording seems to support your interpretation. Does this mean that, a priori, $X$ must contain every possible substring of two digits?
$endgroup$
– hexomino
Aug 14 at 12:13




$begingroup$
@ArnaudMortier Apologies my interpretation was that there be just one instance of $ab$ but I'll admit the wording seems to support your interpretation. Does this mean that, a priori, $X$ must contain every possible substring of two digits?
$endgroup$
– hexomino
Aug 14 at 12:13












$begingroup$
@hexomino Yes, that's how I interpret it.
$endgroup$
– Arnaud Mortier
Aug 14 at 12:16




$begingroup$
@hexomino Yes, that's how I interpret it.
$endgroup$
– Arnaud Mortier
Aug 14 at 12:16

















draft saved

draft discarded
















































Thanks for contributing an answer to Puzzling Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f87074%2fbig-number-puzzle%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Category:9 (number) SubcategoriesMedia in category "9 (number)"Navigation menuUpload mediaGND ID: 4485639-8Library of Congress authority ID: sh85091979ReasonatorScholiaStatistics

Circuit construction for execution of conditional statements using least significant bitHow are two different registers being used as “control”?How exactly is the stated composite state of the two registers being produced using the $R_zz$ controlled rotations?Efficiently performing controlled rotations in HHLWould this quantum algorithm implementation work?How to prepare a superposed states of odd integers from $1$ to $sqrtN$?Why is this implementation of the order finding algorithm not working?Circuit construction for Hamiltonian simulationHow can I invert the least significant bit of a certain term of a superposed state?Implementing an oracleImplementing a controlled sum operation

Magento 2 “No Payment Methods” in Admin New OrderHow to integrate Paypal Express Checkout with the Magento APIMagento 1.5 - Sales > Order > edit order and shipping methods disappearAuto Invoice Check/Money Order Payment methodAdd more simple payment methods?Shipping methods not showingWhat should I do to change payment methods if changing the configuration has no effects?1.9 - No Payment Methods showing upMy Payment Methods not Showing for downloadable/virtual product when checkout?Magento2 API to access internal payment methodHow to call an existing payment methods in the registration form?