Mixing
Digit sums of successive integers
$begingroup$
For a natural number $x$ both, the digit sum of $x$ and the digit sum of $x+1$ are multiples of $7$. What is the smallest possible $x$?
mathematics no-computers number-theory
asked Jan 7 at 21:18
A. P.A. P.
3,83711147
$endgroup$
add a comment |
$begingroup$
For a natural number $x$ both, the digit sum of $x$ and the digit sum of $x+1$ are multiples of $7$. What is the smallest possible $x$?
mathematics no-computers number-theory
asked Jan 7 at 21:18
A. P.A. P.
3,83711147
$endgroup$
$begingroup$
"0∉N" That is false.
$endgroup$
– Acccumulation
Jan 8 at 19:57
$begingroup$
$0 notin mathbb N$ is true or false depending on the application/author/etc.
$endgroup$
– tilper
Jan 8 at 21:01
1
$begingroup$
Before anyone starts a religious war I better delete this statement. rot13(Vg jnf naljnl bayl zrnag gb thvqr crbcyr vagb gur jebat qverpgvba.)
$endgroup$
– A. P.
Jan 8 at 21:45
add a comment |
$begingroup$
For a natural number $x$ both, the digit sum of $x$ and the digit sum of $x+1$ are multiples of $7$. What is the smallest possible $x$?
mathematics no-computers number-theory
asked Jan 7 at 21:18
A. P.A. P.
3,83711147
$endgroup$
For a natural number $x$ both, the digit sum of $x$ and the digit sum of $x+1$ are multiples of $7$. What is the smallest possible $x$?
mathematics no-computers number-theory
mathematics no-computers number-theory
asked Jan 7 at 21:18
A. P.A. P.
3,83711147
asked Jan 7 at 21:18
A. P.A. P.
3,83711147
edited Jan 8 at 21:45
A. P.
asked Jan 7 at 21:18
A. P.A. P.
3,83711147
asked Jan 7 at 21:18
A. P.A. P.
3,83711147
asked Jan 7 at 21:18
A. P.A. P.
3,83711147
3,83711147
$begingroup$
"0∉N" That is false.
$endgroup$
– Acccumulation
Jan 8 at 19:57
$begingroup$
$0 notin mathbb N$ is true or false depending on the application/author/etc.
$endgroup$
– tilper
Jan 8 at 21:01
1
$begingroup$
Before anyone starts a religious war I better delete this statement. rot13(Vg jnf naljnl bayl zrnag gb thvqr crbcyr vagb gur jebat qverpgvba.)
$endgroup$
– A. P.
Jan 8 at 21:45
add a comment |
$begingroup$
"0∉N" That is false.
$endgroup$
– Acccumulation
Jan 8 at 19:57
$begingroup$
$0 notin mathbb N$ is true or false depending on the application/author/etc.
$endgroup$
– tilper
Jan 8 at 21:01
1
$begingroup$
Before anyone starts a religious war I better delete this statement. rot13(Vg jnf naljnl bayl zrnag gb thvqr crbcyr vagb gur jebat qverpgvba.)
$endgroup$
– A. P.
Jan 8 at 21:45
$begingroup$
"0∉N" That is false.
$endgroup$
– Acccumulation
Jan 8 at 19:57
$begingroup$
"0∉N" That is false.
$endgroup$
– Acccumulation
Jan 8 at 19:57
$begingroup$
$0 notin mathbb N$ is true or false depending on the application/author/etc.
$endgroup$
– tilper
Jan 8 at 21:01
$begingroup$
$0 notin mathbb N$ is true or false depending on the application/author/etc.
$endgroup$
– tilper
Jan 8 at 21:01
1
1
$begingroup$
Before anyone starts a religious war I better delete this statement. rot13(Vg jnf naljnl bayl zrnag gb thvqr crbcyr vagb gur jebat qverpgvba.)
$endgroup$
– A. P.
Jan 8 at 21:45
$begingroup$
Before anyone starts a religious war I better delete this statement. rot13(Vg jnf naljnl bayl zrnag gb thvqr crbcyr vagb gur jebat qverpgvba.)
$endgroup$
– A. P.
Jan 8 at 21:45
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
69999 (42) and 70000 (7)
...
No two consecutive integers are both multiples of 7, so this needs to take place at a rollover.
...
Rolling over a single 9 drops the digit sum by 8, which isn't a multiple of 7 either.
...
Similarly, if Y=X+1, X99->Y00 drops by 17 and X999->Y000 drops 26.
...
X9999 to Y0000 is the first drop (35) which is itself a multiple of 7...
...
Any number of 9's that's congruent mod 7 to 4 will work, but they'll be much larger, so the first instance must roll over 4 9's.
...
From there, all that remains is to find the first multiple of 10000 with an appropriate digit sum.
...
My initial, less confidence-inspiring method just recognized that 7*10^n was a likely candidate for x+1, and so I started appending 9's to a single 6 until the sum worked out...
answered Jan 7 at 21:32
ZomulgustarZomulgustar
1,898723
$endgroup$
1
$begingroup$
As this is a 'no-computers' puzzle, could you elaborate on how you find this number? Most likely you will also see whether it's minimal if you go through these steps.
$endgroup$
– A. P.
Jan 7 at 21:37
add a comment |
$begingroup$
Suppose x+1 is of the form a*10^n, where the last digit of a is not 0. Then both digitsum(a) and digitsum(a-1)+9*n are multiples of 7. Since digitsum(a-1) = digitsum(a)-1, and the difference between any two multiples of 7 is itself a multiple of 7, we have that 9*n-1 is a multiple of 7. 9*n-1 = (7+2)n-1 = 7n+2n-1, which is a multiple of 7 iff 2n-1 is a multiple of 7. So for the smallest number, we should take 2n-1 = 7, which makes n equal to 4. The smallest possible value of a is 7, giving x = 69999.
answered Jan 8 at 20:08
AcccumulationAcccumulation
484110
$endgroup$
add a comment |
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: "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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f78222%2fdigit-sums-of-successive-integers%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
$begingroup$
69999 (42) and 70000 (7)
...
No two consecutive integers are both multiples of 7, so this needs to take place at a rollover.
...
Rolling over a single 9 drops the digit sum by 8, which isn't a multiple of 7 either.
...
Similarly, if Y=X+1, X99->Y00 drops by 17 and X999->Y000 drops 26.
...
X9999 to Y0000 is the first drop (35) which is itself a multiple of 7...
...
Any number of 9's that's congruent mod 7 to 4 will work, but they'll be much larger, so the first instance must roll over 4 9's.
...
From there, all that remains is to find the first multiple of 10000 with an appropriate digit sum.
...
My initial, less confidence-inspiring method just recognized that 7*10^n was a likely candidate for x+1, and so I started appending 9's to a single 6 until the sum worked out...
answered Jan 7 at 21:32
ZomulgustarZomulgustar
1,898723
$endgroup$
1
$begingroup$
As this is a 'no-computers' puzzle, could you elaborate on how you find this number? Most likely you will also see whether it's minimal if you go through these steps.
$endgroup$
– A. P.
Jan 7 at 21:37
add a comment |
$begingroup$
69999 (42) and 70000 (7)
...
No two consecutive integers are both multiples of 7, so this needs to take place at a rollover.
...
Rolling over a single 9 drops the digit sum by 8, which isn't a multiple of 7 either.
...
Similarly, if Y=X+1, X99->Y00 drops by 17 and X999->Y000 drops 26.
...
X9999 to Y0000 is the first drop (35) which is itself a multiple of 7...
...
Any number of 9's that's congruent mod 7 to 4 will work, but they'll be much larger, so the first instance must roll over 4 9's.
...
From there, all that remains is to find the first multiple of 10000 with an appropriate digit sum.
...
My initial, less confidence-inspiring method just recognized that 7*10^n was a likely candidate for x+1, and so I started appending 9's to a single 6 until the sum worked out...
answered Jan 7 at 21:32
ZomulgustarZomulgustar
1,898723
$endgroup$
1
$begingroup$
As this is a 'no-computers' puzzle, could you elaborate on how you find this number? Most likely you will also see whether it's minimal if you go through these steps.
$endgroup$
– A. P.
Jan 7 at 21:37
add a comment |
$begingroup$
69999 (42) and 70000 (7)
...
No two consecutive integers are both multiples of 7, so this needs to take place at a rollover.
...
Rolling over a single 9 drops the digit sum by 8, which isn't a multiple of 7 either.
...
Similarly, if Y=X+1, X99->Y00 drops by 17 and X999->Y000 drops 26.
...
X9999 to Y0000 is the first drop (35) which is itself a multiple of 7...
...
Any number of 9's that's congruent mod 7 to 4 will work, but they'll be much larger, so the first instance must roll over 4 9's.
...
From there, all that remains is to find the first multiple of 10000 with an appropriate digit sum.
...
My initial, less confidence-inspiring method just recognized that 7*10^n was a likely candidate for x+1, and so I started appending 9's to a single 6 until the sum worked out...
answered Jan 7 at 21:32
ZomulgustarZomulgustar
1,898723
$endgroup$
69999 (42) and 70000 (7)
...
No two consecutive integers are both multiples of 7, so this needs to take place at a rollover.
...
Rolling over a single 9 drops the digit sum by 8, which isn't a multiple of 7 either.
...
Similarly, if Y=X+1, X99->Y00 drops by 17 and X999->Y000 drops 26.
...
X9999 to Y0000 is the first drop (35) which is itself a multiple of 7...
...
Any number of 9's that's congruent mod 7 to 4 will work, but they'll be much larger, so the first instance must roll over 4 9's.
...
From there, all that remains is to find the first multiple of 10000 with an appropriate digit sum.
...
My initial, less confidence-inspiring method just recognized that 7*10^n was a likely candidate for x+1, and so I started appending 9's to a single 6 until the sum worked out...
answered Jan 7 at 21:32
ZomulgustarZomulgustar
1,898723
edited Jan 7 at 22:21
answered Jan 7 at 21:32
ZomulgustarZomulgustar
1,898723
answered Jan 7 at 21:32
ZomulgustarZomulgustar
1,898723
answered Jan 7 at 21:32
ZomulgustarZomulgustar
1,898723
1,898723
1
$begingroup$
As this is a 'no-computers' puzzle, could you elaborate on how you find this number? Most likely you will also see whether it's minimal if you go through these steps.
$endgroup$
– A. P.
Jan 7 at 21:37
add a comment |
1
$begingroup$
As this is a 'no-computers' puzzle, could you elaborate on how you find this number? Most likely you will also see whether it's minimal if you go through these steps.
$endgroup$
– A. P.
Jan 7 at 21:37
1
1
$begingroup$
As this is a 'no-computers' puzzle, could you elaborate on how you find this number? Most likely you will also see whether it's minimal if you go through these steps.
$endgroup$
– A. P.
Jan 7 at 21:37
$begingroup$
As this is a 'no-computers' puzzle, could you elaborate on how you find this number? Most likely you will also see whether it's minimal if you go through these steps.
$endgroup$
– A. P.
Jan 7 at 21:37
add a comment |
$begingroup$
Suppose x+1 is of the form a*10^n, where the last digit of a is not 0. Then both digitsum(a) and digitsum(a-1)+9*n are multiples of 7. Since digitsum(a-1) = digitsum(a)-1, and the difference between any two multiples of 7 is itself a multiple of 7, we have that 9*n-1 is a multiple of 7. 9*n-1 = (7+2)n-1 = 7n+2n-1, which is a multiple of 7 iff 2n-1 is a multiple of 7. So for the smallest number, we should take 2n-1 = 7, which makes n equal to 4. The smallest possible value of a is 7, giving x = 69999.
answered Jan 8 at 20:08
AcccumulationAcccumulation
484110
$endgroup$
add a comment |
$begingroup$
Suppose x+1 is of the form a*10^n, where the last digit of a is not 0. Then both digitsum(a) and digitsum(a-1)+9*n are multiples of 7. Since digitsum(a-1) = digitsum(a)-1, and the difference between any two multiples of 7 is itself a multiple of 7, we have that 9*n-1 is a multiple of 7. 9*n-1 = (7+2)n-1 = 7n+2n-1, which is a multiple of 7 iff 2n-1 is a multiple of 7. So for the smallest number, we should take 2n-1 = 7, which makes n equal to 4. The smallest possible value of a is 7, giving x = 69999.
answered Jan 8 at 20:08
AcccumulationAcccumulation
484110
$endgroup$
add a comment |
$begingroup$
Suppose x+1 is of the form a*10^n, where the last digit of a is not 0. Then both digitsum(a) and digitsum(a-1)+9*n are multiples of 7. Since digitsum(a-1) = digitsum(a)-1, and the difference between any two multiples of 7 is itself a multiple of 7, we have that 9*n-1 is a multiple of 7. 9*n-1 = (7+2)n-1 = 7n+2n-1, which is a multiple of 7 iff 2n-1 is a multiple of 7. So for the smallest number, we should take 2n-1 = 7, which makes n equal to 4. The smallest possible value of a is 7, giving x = 69999.
answered Jan 8 at 20:08
AcccumulationAcccumulation
484110
$endgroup$
Suppose x+1 is of the form a*10^n, where the last digit of a is not 0. Then both digitsum(a) and digitsum(a-1)+9*n are multiples of 7. Since digitsum(a-1) = digitsum(a)-1, and the difference between any two multiples of 7 is itself a multiple of 7, we have that 9*n-1 is a multiple of 7. 9*n-1 = (7+2)n-1 = 7n+2n-1, which is a multiple of 7 iff 2n-1 is a multiple of 7. So for the smallest number, we should take 2n-1 = 7, which makes n equal to 4. The smallest possible value of a is 7, giving x = 69999.
answered Jan 8 at 20:08
AcccumulationAcccumulation
484110
answered Jan 8 at 20:08
AcccumulationAcccumulation
484110
answered Jan 8 at 20:08
AcccumulationAcccumulation
484110
answered Jan 8 at 20:08
AcccumulationAcccumulation
484110
484110
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f78222%2fdigit-sums-of-successive-integers%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$begingroup$
"0∉N" That is false.
$endgroup$
– Acccumulation
Jan 8 at 19:57
$begingroup$
$0 notin mathbb N$ is true or false depending on the application/author/etc.
$endgroup$
– tilper
Jan 8 at 21:01
1
$begingroup$
Before anyone starts a religious war I better delete this statement. rot13(Vg jnf naljnl bayl zrnag gb thvqr crbcyr vagb gur jebat qverpgvba.)
$endgroup$
– A. P.
Jan 8 at 21:45