Construct a positive decimal number of length $n$ or less that is divisible by $2^n-1$ for n in $Z^+_0$












0












$begingroup$


I got this question on a discrete mathematics test and I no idea on how to solve it:




Create a method for constructing a positive decimal number of length $n$ or less with digits from set ${0,1,8,9}$ that is divisible by $2^n-1$, where n is in the nonnegative integers.




I would appreciate any help. I spent so long thinking about it and nothing clicks.






combinatorics number-theory elementary-number-theory algorithms







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Try thinking in binary. What is $2^n - 1$ in binary? What does it look like in binary when you create a decimal number with ${0,1,8,9}$?
    $endgroup$
    – Larry B.
    Dec 18 '18 at 23:54
















0












$begingroup$


I got this question on a discrete mathematics test and I no idea on how to solve it:




Create a method for constructing a positive decimal number of length $n$ or less with digits from set ${0,1,8,9}$ that is divisible by $2^n-1$, where n is in the nonnegative integers.




I would appreciate any help. I spent so long thinking about it and nothing clicks.






combinatorics number-theory elementary-number-theory algorithms







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Try thinking in binary. What is $2^n - 1$ in binary? What does it look like in binary when you create a decimal number with ${0,1,8,9}$?
    $endgroup$
    – Larry B.
    Dec 18 '18 at 23:54














0












0








0





$begingroup$


I got this question on a discrete mathematics test and I no idea on how to solve it:




Create a method for constructing a positive decimal number of length $n$ or less with digits from set ${0,1,8,9}$ that is divisible by $2^n-1$, where n is in the nonnegative integers.




I would appreciate any help. I spent so long thinking about it and nothing clicks.






combinatorics number-theory elementary-number-theory algorithms







share|cite|improve this question











$endgroup$




I got this question on a discrete mathematics test and I no idea on how to solve it:




Create a method for constructing a positive decimal number of length $n$ or less with digits from set ${0,1,8,9}$ that is divisible by $2^n-1$, where n is in the nonnegative integers.




I would appreciate any help. I spent so long thinking about it and nothing clicks.






combinatorics number-theory elementary-number-theory algorithms




combinatorics number-theory elementary-number-theory algorithms






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 18 '18 at 23:50









Lucas Henrique

1,036414




1,036414










asked Dec 18 '18 at 23:44









TheGodProjectTheGodProject

32




32








  • 1




    $begingroup$
    Try thinking in binary. What is $2^n - 1$ in binary? What does it look like in binary when you create a decimal number with ${0,1,8,9}$?
    $endgroup$
    – Larry B.
    Dec 18 '18 at 23:54














  • 1




    $begingroup$
    Try thinking in binary. What is $2^n - 1$ in binary? What does it look like in binary when you create a decimal number with ${0,1,8,9}$?
    $endgroup$
    – Larry B.
    Dec 18 '18 at 23:54








1




1




$begingroup$
Try thinking in binary. What is $2^n - 1$ in binary? What does it look like in binary when you create a decimal number with ${0,1,8,9}$?
$endgroup$
– Larry B.
Dec 18 '18 at 23:54




$begingroup$
Try thinking in binary. What is $2^n - 1$ in binary? What does it look like in binary when you create a decimal number with ${0,1,8,9}$?
$endgroup$
– Larry B.
Dec 18 '18 at 23:54










1 Answer
1






active

oldest

votes


















0












$begingroup$

We consider two points:



First:Note that the sum of given digits is $18$, that indicates the required number is divisible by $9$.



Second: Any number of form $(d_1d_2d_3...0d_1d_2d_3)$ is divisible by 11 iff number of digits $d_1, d_2, d_3 . . .$ is even, for example $23023=11times2093$ or $472904729=11times42991339$ etc.



Considering these points, we suppose $n=11$; with a four digit number like $abcd$; which is not divisible by 11 by given digits (i.e. 0,1,8 and 9), for $a=8$ , $b=0$ and $c=9$ we get:



$abcd=8091$



The required number must also be divisible by $11$, so the solution can be $809108091$ and we have:



$2^{11-1}-1=2^{10}-1=1023$



And:



$809108091=1023times790917$



Numbers $8091080910$ and $80910809100$ can also be solutions.
Other arrangements of digits does not give the solution.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    It needn't be divisible by 9; 181 would be valid but not divisible by 9
    $endgroup$
    – Benedict Randall Shaw
    Dec 20 '18 at 16:39











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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%2fmath.stackexchange.com%2fquestions%2f3045847%2fconstruct-a-positive-decimal-number-of-length-n-or-less-that-is-divisible-by%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0












$begingroup$

We consider two points:



First:Note that the sum of given digits is $18$, that indicates the required number is divisible by $9$.



Second: Any number of form $(d_1d_2d_3...0d_1d_2d_3)$ is divisible by 11 iff number of digits $d_1, d_2, d_3 . . .$ is even, for example $23023=11times2093$ or $472904729=11times42991339$ etc.



Considering these points, we suppose $n=11$; with a four digit number like $abcd$; which is not divisible by 11 by given digits (i.e. 0,1,8 and 9), for $a=8$ , $b=0$ and $c=9$ we get:



$abcd=8091$



The required number must also be divisible by $11$, so the solution can be $809108091$ and we have:



$2^{11-1}-1=2^{10}-1=1023$



And:



$809108091=1023times790917$



Numbers $8091080910$ and $80910809100$ can also be solutions.
Other arrangements of digits does not give the solution.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    It needn't be divisible by 9; 181 would be valid but not divisible by 9
    $endgroup$
    – Benedict Randall Shaw
    Dec 20 '18 at 16:39
















0












$begingroup$

We consider two points:



First:Note that the sum of given digits is $18$, that indicates the required number is divisible by $9$.



Second: Any number of form $(d_1d_2d_3...0d_1d_2d_3)$ is divisible by 11 iff number of digits $d_1, d_2, d_3 . . .$ is even, for example $23023=11times2093$ or $472904729=11times42991339$ etc.



Considering these points, we suppose $n=11$; with a four digit number like $abcd$; which is not divisible by 11 by given digits (i.e. 0,1,8 and 9), for $a=8$ , $b=0$ and $c=9$ we get:



$abcd=8091$



The required number must also be divisible by $11$, so the solution can be $809108091$ and we have:



$2^{11-1}-1=2^{10}-1=1023$



And:



$809108091=1023times790917$



Numbers $8091080910$ and $80910809100$ can also be solutions.
Other arrangements of digits does not give the solution.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    It needn't be divisible by 9; 181 would be valid but not divisible by 9
    $endgroup$
    – Benedict Randall Shaw
    Dec 20 '18 at 16:39














0












0








0





$begingroup$

We consider two points:



First:Note that the sum of given digits is $18$, that indicates the required number is divisible by $9$.



Second: Any number of form $(d_1d_2d_3...0d_1d_2d_3)$ is divisible by 11 iff number of digits $d_1, d_2, d_3 . . .$ is even, for example $23023=11times2093$ or $472904729=11times42991339$ etc.



Considering these points, we suppose $n=11$; with a four digit number like $abcd$; which is not divisible by 11 by given digits (i.e. 0,1,8 and 9), for $a=8$ , $b=0$ and $c=9$ we get:



$abcd=8091$



The required number must also be divisible by $11$, so the solution can be $809108091$ and we have:



$2^{11-1}-1=2^{10}-1=1023$



And:



$809108091=1023times790917$



Numbers $8091080910$ and $80910809100$ can also be solutions.
Other arrangements of digits does not give the solution.






share|cite|improve this answer











$endgroup$



We consider two points:



First:Note that the sum of given digits is $18$, that indicates the required number is divisible by $9$.



Second: Any number of form $(d_1d_2d_3...0d_1d_2d_3)$ is divisible by 11 iff number of digits $d_1, d_2, d_3 . . .$ is even, for example $23023=11times2093$ or $472904729=11times42991339$ etc.



Considering these points, we suppose $n=11$; with a four digit number like $abcd$; which is not divisible by 11 by given digits (i.e. 0,1,8 and 9), for $a=8$ , $b=0$ and $c=9$ we get:



$abcd=8091$



The required number must also be divisible by $11$, so the solution can be $809108091$ and we have:



$2^{11-1}-1=2^{10}-1=1023$



And:



$809108091=1023times790917$



Numbers $8091080910$ and $80910809100$ can also be solutions.
Other arrangements of digits does not give the solution.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 22 '18 at 9:53

























answered Dec 20 '18 at 16:35









siroussirous

1,6711514




1,6711514








  • 1




    $begingroup$
    It needn't be divisible by 9; 181 would be valid but not divisible by 9
    $endgroup$
    – Benedict Randall Shaw
    Dec 20 '18 at 16:39














  • 1




    $begingroup$
    It needn't be divisible by 9; 181 would be valid but not divisible by 9
    $endgroup$
    – Benedict Randall Shaw
    Dec 20 '18 at 16:39








1




1




$begingroup$
It needn't be divisible by 9; 181 would be valid but not divisible by 9
$endgroup$
– Benedict Randall Shaw
Dec 20 '18 at 16:39




$begingroup$
It needn't be divisible by 9; 181 would be valid but not divisible by 9
$endgroup$
– Benedict Randall Shaw
Dec 20 '18 at 16:39


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics 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%2fmath.stackexchange.com%2fquestions%2f3045847%2fconstruct-a-positive-decimal-number-of-length-n-or-less-that-is-divisible-by%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

Quarter-circle Tiles

Image
up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
Read more

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Image
0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
Read more

Mont Emei

Image
Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
Read more