Prove that in every 100 consecutive integers there is an integer whose digits sum to a number divisible by 14












1












$begingroup$



Prove that in every 100 consecutive integers there is an integer whose digits sum to a number divisible by 14




How would one go about proving this? Many thanks!






elementary-number-theory







share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    What have you tried so far?
    $endgroup$
    – John Douma
    Jan 2 at 0:32










  • $begingroup$
    Every 14th integer is divisible by 14 so in a series of 100 consecutive integers.............?????
    $endgroup$
    – Phil H
    Jan 2 at 0:36






  • 1




    $begingroup$
    @PhilH OP is asking for the sum of the digits to be divisible by $14$, not the number itself.
    $endgroup$
    – saulspatz
    Jan 2 at 0:38






  • 2




    $begingroup$
    Have you written down the first few numbers that satisfy the condition?
    $endgroup$
    – saulspatz
    Jan 2 at 0:40






  • 1




    $begingroup$
    In a set of 100 consecutive integers, you can write each number as $10a + b$, where a and b form the tens and ones place, respectively. Over those 100 digits, we can ignore the hundreds, the thousands, etc. places. Then both $a$ and $b$ will have cycled through the digits $0-9$ at least once. 14, as a sum of two digits, can be expressed as $9+5, 8+6, 7+7, 6+8, 5+9$, so that means in 100 consecutive integers, there will be at most $5$ numbers whose digital sum is 14. This only works up to a certain number, of course, because you'll hit something like $1,234,567,890$ to $1,234,567,990$, failing.
    $endgroup$
    – Christopher Marley
    Jan 2 at 1:01
















1












$begingroup$



Prove that in every 100 consecutive integers there is an integer whose digits sum to a number divisible by 14




How would one go about proving this? Many thanks!






elementary-number-theory







share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    What have you tried so far?
    $endgroup$
    – John Douma
    Jan 2 at 0:32










  • $begingroup$
    Every 14th integer is divisible by 14 so in a series of 100 consecutive integers.............?????
    $endgroup$
    – Phil H
    Jan 2 at 0:36






  • 1




    $begingroup$
    @PhilH OP is asking for the sum of the digits to be divisible by $14$, not the number itself.
    $endgroup$
    – saulspatz
    Jan 2 at 0:38






  • 2




    $begingroup$
    Have you written down the first few numbers that satisfy the condition?
    $endgroup$
    – saulspatz
    Jan 2 at 0:40






  • 1




    $begingroup$
    In a set of 100 consecutive integers, you can write each number as $10a + b$, where a and b form the tens and ones place, respectively. Over those 100 digits, we can ignore the hundreds, the thousands, etc. places. Then both $a$ and $b$ will have cycled through the digits $0-9$ at least once. 14, as a sum of two digits, can be expressed as $9+5, 8+6, 7+7, 6+8, 5+9$, so that means in 100 consecutive integers, there will be at most $5$ numbers whose digital sum is 14. This only works up to a certain number, of course, because you'll hit something like $1,234,567,890$ to $1,234,567,990$, failing.
    $endgroup$
    – Christopher Marley
    Jan 2 at 1:01














1












1








1


1



$begingroup$



Prove that in every 100 consecutive integers there is an integer whose digits sum to a number divisible by 14




How would one go about proving this? Many thanks!






elementary-number-theory







share|cite|improve this question









$endgroup$





Prove that in every 100 consecutive integers there is an integer whose digits sum to a number divisible by 14




How would one go about proving this? Many thanks!






elementary-number-theory




elementary-number-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 2 at 0:27









DCAM56DCAM56

61




61








  • 2




    $begingroup$
    What have you tried so far?
    $endgroup$
    – John Douma
    Jan 2 at 0:32










  • $begingroup$
    Every 14th integer is divisible by 14 so in a series of 100 consecutive integers.............?????
    $endgroup$
    – Phil H
    Jan 2 at 0:36






  • 1




    $begingroup$
    @PhilH OP is asking for the sum of the digits to be divisible by $14$, not the number itself.
    $endgroup$
    – saulspatz
    Jan 2 at 0:38






  • 2




    $begingroup$
    Have you written down the first few numbers that satisfy the condition?
    $endgroup$
    – saulspatz
    Jan 2 at 0:40






  • 1




    $begingroup$
    In a set of 100 consecutive integers, you can write each number as $10a + b$, where a and b form the tens and ones place, respectively. Over those 100 digits, we can ignore the hundreds, the thousands, etc. places. Then both $a$ and $b$ will have cycled through the digits $0-9$ at least once. 14, as a sum of two digits, can be expressed as $9+5, 8+6, 7+7, 6+8, 5+9$, so that means in 100 consecutive integers, there will be at most $5$ numbers whose digital sum is 14. This only works up to a certain number, of course, because you'll hit something like $1,234,567,890$ to $1,234,567,990$, failing.
    $endgroup$
    – Christopher Marley
    Jan 2 at 1:01














  • 2




    $begingroup$
    What have you tried so far?
    $endgroup$
    – John Douma
    Jan 2 at 0:32










  • $begingroup$
    Every 14th integer is divisible by 14 so in a series of 100 consecutive integers.............?????
    $endgroup$
    – Phil H
    Jan 2 at 0:36






  • 1




    $begingroup$
    @PhilH OP is asking for the sum of the digits to be divisible by $14$, not the number itself.
    $endgroup$
    – saulspatz
    Jan 2 at 0:38






  • 2




    $begingroup$
    Have you written down the first few numbers that satisfy the condition?
    $endgroup$
    – saulspatz
    Jan 2 at 0:40






  • 1




    $begingroup$
    In a set of 100 consecutive integers, you can write each number as $10a + b$, where a and b form the tens and ones place, respectively. Over those 100 digits, we can ignore the hundreds, the thousands, etc. places. Then both $a$ and $b$ will have cycled through the digits $0-9$ at least once. 14, as a sum of two digits, can be expressed as $9+5, 8+6, 7+7, 6+8, 5+9$, so that means in 100 consecutive integers, there will be at most $5$ numbers whose digital sum is 14. This only works up to a certain number, of course, because you'll hit something like $1,234,567,890$ to $1,234,567,990$, failing.
    $endgroup$
    – Christopher Marley
    Jan 2 at 1:01








2




2




$begingroup$
What have you tried so far?
$endgroup$
– John Douma
Jan 2 at 0:32




$begingroup$
What have you tried so far?
$endgroup$
– John Douma
Jan 2 at 0:32












$begingroup$
Every 14th integer is divisible by 14 so in a series of 100 consecutive integers.............?????
$endgroup$
– Phil H
Jan 2 at 0:36




$begingroup$
Every 14th integer is divisible by 14 so in a series of 100 consecutive integers.............?????
$endgroup$
– Phil H
Jan 2 at 0:36




1




1




$begingroup$
@PhilH OP is asking for the sum of the digits to be divisible by $14$, not the number itself.
$endgroup$
– saulspatz
Jan 2 at 0:38




$begingroup$
@PhilH OP is asking for the sum of the digits to be divisible by $14$, not the number itself.
$endgroup$
– saulspatz
Jan 2 at 0:38




2




2




$begingroup$
Have you written down the first few numbers that satisfy the condition?
$endgroup$
– saulspatz
Jan 2 at 0:40




$begingroup$
Have you written down the first few numbers that satisfy the condition?
$endgroup$
– saulspatz
Jan 2 at 0:40




1




1




$begingroup$
In a set of 100 consecutive integers, you can write each number as $10a + b$, where a and b form the tens and ones place, respectively. Over those 100 digits, we can ignore the hundreds, the thousands, etc. places. Then both $a$ and $b$ will have cycled through the digits $0-9$ at least once. 14, as a sum of two digits, can be expressed as $9+5, 8+6, 7+7, 6+8, 5+9$, so that means in 100 consecutive integers, there will be at most $5$ numbers whose digital sum is 14. This only works up to a certain number, of course, because you'll hit something like $1,234,567,890$ to $1,234,567,990$, failing.
$endgroup$
– Christopher Marley
Jan 2 at 1:01




$begingroup$
In a set of 100 consecutive integers, you can write each number as $10a + b$, where a and b form the tens and ones place, respectively. Over those 100 digits, we can ignore the hundreds, the thousands, etc. places. Then both $a$ and $b$ will have cycled through the digits $0-9$ at least once. 14, as a sum of two digits, can be expressed as $9+5, 8+6, 7+7, 6+8, 5+9$, so that means in 100 consecutive integers, there will be at most $5$ numbers whose digital sum is 14. This only works up to a certain number, of course, because you'll hit something like $1,234,567,890$ to $1,234,567,990$, failing.
$endgroup$
– Christopher Marley
Jan 2 at 1:01










1 Answer
1






active

oldest

votes


















2












$begingroup$

One of these 100 consecutive integers $a$ will end in 00. Say that the remainder of $a$ divided by 14 is $vin{0,1,ldots,13}$.



Case 1. There exist among these 100 consecutive integers at least 49 larger than $a$.
In such case the remainders of the sum of the digits of $a,a+1,ldots,a+49$ will range between
$$
a!!!!!!mod!! 14,,, a+1!!!!!!mod!! 14,ldots, a+49!!!!!!mod!! 14,
$$
and hence will cover the whole of ${0,1,ldots,13}$.



Case 2. There exist among these 100 consecutive integers at least 50 smaller than $a$. Then we shall 50 numbers with two last digits ranging for 50 to 99 and all the other digits identical, and if the remainder the sum of the digits
of the one ending in 50 is $w$ then we shall have as remainders
$$
w!!!!!!mod! 14, w+1!!!!!!mod 14,ldots, w+49!!!!!!mod 14
$$
which again will cover the whole of ${0,1,ldots,13}$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Note the OP asked for the sum of the digits being divisible by $14$, not the number itself. Your proof is basically correct, but there are $2$ things you should change. First, have $v$ and $w$ be the remainders of the number when divided by $14$. Second, your list of "mod" statements should end with $a + 4 + 9 mod 14$, with a statement that all of the possible remainders from $0$ to $13$ inclusive are included so, no matter the starting point, one of them needs to be equal to a multiple of $14$. Also, you may wish to provide a more detailed explanation for this part.
    $endgroup$
    – John Omielan
    Jan 2 at 2:01












  • $begingroup$
    @JohnOmielan See my revised answer.
    $endgroup$
    – Yiorgos S. Smyrlis
    Jan 2 at 13:01










  • $begingroup$
    Thanks for making the corrections. However, this might be a bit picky, but note your $2$ sets of mod statements are not quite correct at the end. This is because $w + 49 mod 14$ is not the same as $w + 4 + 9 mod 14$ as $49 - 4 - 9 = 36$ with $36 equiv{8} pmod{14}$. This is why I suggested my earlier change. However, here is a perhaps a slightly easier way to see this, & how I see it myself. Note you only need to use $0$ to $3$, then end with $4 + 0, ldots 4 + 9$ for $40$ to $49$, with this more simply & directly showing it covers all $0$ to $13$ values.
    $endgroup$
    – John Omielan
    Jan 2 at 17:57












  • $begingroup$
    One other thing you may wish to do is make it explicit why $100$ is the minimum value for this problem. It's because between $0$ to $49$, the span of $0$ to $13$ for the sum of digits is only achieved with the final value, i.e., $49$, giving $13$. Thus, there may be cases where a smaller set of consecutive set of integers don't have any which are a multiple of $14$. Note, however, I haven't tried to prove this rigorously myself (e.g., perhaps $99$ might still work), so I suggest you first confirm this yourself before potentially mentioning it.
    $endgroup$
    – John Omielan
    Jan 2 at 18:04











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%2f3059026%2fprove-that-in-every-100-consecutive-integers-there-is-an-integer-whose-digits-su%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









2












$begingroup$

One of these 100 consecutive integers $a$ will end in 00. Say that the remainder of $a$ divided by 14 is $vin{0,1,ldots,13}$.



Case 1. There exist among these 100 consecutive integers at least 49 larger than $a$.
In such case the remainders of the sum of the digits of $a,a+1,ldots,a+49$ will range between
$$
a!!!!!!mod!! 14,,, a+1!!!!!!mod!! 14,ldots, a+49!!!!!!mod!! 14,
$$
and hence will cover the whole of ${0,1,ldots,13}$.



Case 2. There exist among these 100 consecutive integers at least 50 smaller than $a$. Then we shall 50 numbers with two last digits ranging for 50 to 99 and all the other digits identical, and if the remainder the sum of the digits
of the one ending in 50 is $w$ then we shall have as remainders
$$
w!!!!!!mod! 14, w+1!!!!!!mod 14,ldots, w+49!!!!!!mod 14
$$
which again will cover the whole of ${0,1,ldots,13}$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Note the OP asked for the sum of the digits being divisible by $14$, not the number itself. Your proof is basically correct, but there are $2$ things you should change. First, have $v$ and $w$ be the remainders of the number when divided by $14$. Second, your list of "mod" statements should end with $a + 4 + 9 mod 14$, with a statement that all of the possible remainders from $0$ to $13$ inclusive are included so, no matter the starting point, one of them needs to be equal to a multiple of $14$. Also, you may wish to provide a more detailed explanation for this part.
    $endgroup$
    – John Omielan
    Jan 2 at 2:01












  • $begingroup$
    @JohnOmielan See my revised answer.
    $endgroup$
    – Yiorgos S. Smyrlis
    Jan 2 at 13:01










  • $begingroup$
    Thanks for making the corrections. However, this might be a bit picky, but note your $2$ sets of mod statements are not quite correct at the end. This is because $w + 49 mod 14$ is not the same as $w + 4 + 9 mod 14$ as $49 - 4 - 9 = 36$ with $36 equiv{8} pmod{14}$. This is why I suggested my earlier change. However, here is a perhaps a slightly easier way to see this, & how I see it myself. Note you only need to use $0$ to $3$, then end with $4 + 0, ldots 4 + 9$ for $40$ to $49$, with this more simply & directly showing it covers all $0$ to $13$ values.
    $endgroup$
    – John Omielan
    Jan 2 at 17:57












  • $begingroup$
    One other thing you may wish to do is make it explicit why $100$ is the minimum value for this problem. It's because between $0$ to $49$, the span of $0$ to $13$ for the sum of digits is only achieved with the final value, i.e., $49$, giving $13$. Thus, there may be cases where a smaller set of consecutive set of integers don't have any which are a multiple of $14$. Note, however, I haven't tried to prove this rigorously myself (e.g., perhaps $99$ might still work), so I suggest you first confirm this yourself before potentially mentioning it.
    $endgroup$
    – John Omielan
    Jan 2 at 18:04
















2












$begingroup$

One of these 100 consecutive integers $a$ will end in 00. Say that the remainder of $a$ divided by 14 is $vin{0,1,ldots,13}$.



Case 1. There exist among these 100 consecutive integers at least 49 larger than $a$.
In such case the remainders of the sum of the digits of $a,a+1,ldots,a+49$ will range between
$$
a!!!!!!mod!! 14,,, a+1!!!!!!mod!! 14,ldots, a+49!!!!!!mod!! 14,
$$
and hence will cover the whole of ${0,1,ldots,13}$.



Case 2. There exist among these 100 consecutive integers at least 50 smaller than $a$. Then we shall 50 numbers with two last digits ranging for 50 to 99 and all the other digits identical, and if the remainder the sum of the digits
of the one ending in 50 is $w$ then we shall have as remainders
$$
w!!!!!!mod! 14, w+1!!!!!!mod 14,ldots, w+49!!!!!!mod 14
$$
which again will cover the whole of ${0,1,ldots,13}$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Note the OP asked for the sum of the digits being divisible by $14$, not the number itself. Your proof is basically correct, but there are $2$ things you should change. First, have $v$ and $w$ be the remainders of the number when divided by $14$. Second, your list of "mod" statements should end with $a + 4 + 9 mod 14$, with a statement that all of the possible remainders from $0$ to $13$ inclusive are included so, no matter the starting point, one of them needs to be equal to a multiple of $14$. Also, you may wish to provide a more detailed explanation for this part.
    $endgroup$
    – John Omielan
    Jan 2 at 2:01












  • $begingroup$
    @JohnOmielan See my revised answer.
    $endgroup$
    – Yiorgos S. Smyrlis
    Jan 2 at 13:01










  • $begingroup$
    Thanks for making the corrections. However, this might be a bit picky, but note your $2$ sets of mod statements are not quite correct at the end. This is because $w + 49 mod 14$ is not the same as $w + 4 + 9 mod 14$ as $49 - 4 - 9 = 36$ with $36 equiv{8} pmod{14}$. This is why I suggested my earlier change. However, here is a perhaps a slightly easier way to see this, & how I see it myself. Note you only need to use $0$ to $3$, then end with $4 + 0, ldots 4 + 9$ for $40$ to $49$, with this more simply & directly showing it covers all $0$ to $13$ values.
    $endgroup$
    – John Omielan
    Jan 2 at 17:57












  • $begingroup$
    One other thing you may wish to do is make it explicit why $100$ is the minimum value for this problem. It's because between $0$ to $49$, the span of $0$ to $13$ for the sum of digits is only achieved with the final value, i.e., $49$, giving $13$. Thus, there may be cases where a smaller set of consecutive set of integers don't have any which are a multiple of $14$. Note, however, I haven't tried to prove this rigorously myself (e.g., perhaps $99$ might still work), so I suggest you first confirm this yourself before potentially mentioning it.
    $endgroup$
    – John Omielan
    Jan 2 at 18:04














2












2








2





$begingroup$

One of these 100 consecutive integers $a$ will end in 00. Say that the remainder of $a$ divided by 14 is $vin{0,1,ldots,13}$.



Case 1. There exist among these 100 consecutive integers at least 49 larger than $a$.
In such case the remainders of the sum of the digits of $a,a+1,ldots,a+49$ will range between
$$
a!!!!!!mod!! 14,,, a+1!!!!!!mod!! 14,ldots, a+49!!!!!!mod!! 14,
$$
and hence will cover the whole of ${0,1,ldots,13}$.



Case 2. There exist among these 100 consecutive integers at least 50 smaller than $a$. Then we shall 50 numbers with two last digits ranging for 50 to 99 and all the other digits identical, and if the remainder the sum of the digits
of the one ending in 50 is $w$ then we shall have as remainders
$$
w!!!!!!mod! 14, w+1!!!!!!mod 14,ldots, w+49!!!!!!mod 14
$$
which again will cover the whole of ${0,1,ldots,13}$.






share|cite|improve this answer











$endgroup$



One of these 100 consecutive integers $a$ will end in 00. Say that the remainder of $a$ divided by 14 is $vin{0,1,ldots,13}$.



Case 1. There exist among these 100 consecutive integers at least 49 larger than $a$.
In such case the remainders of the sum of the digits of $a,a+1,ldots,a+49$ will range between
$$
a!!!!!!mod!! 14,,, a+1!!!!!!mod!! 14,ldots, a+49!!!!!!mod!! 14,
$$
and hence will cover the whole of ${0,1,ldots,13}$.



Case 2. There exist among these 100 consecutive integers at least 50 smaller than $a$. Then we shall 50 numbers with two last digits ranging for 50 to 99 and all the other digits identical, and if the remainder the sum of the digits
of the one ending in 50 is $w$ then we shall have as remainders
$$
w!!!!!!mod! 14, w+1!!!!!!mod 14,ldots, w+49!!!!!!mod 14
$$
which again will cover the whole of ${0,1,ldots,13}$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 2 at 13:00

























answered Jan 2 at 1:04









Yiorgos S. SmyrlisYiorgos S. Smyrlis

63.4k1385163




63.4k1385163












  • $begingroup$
    Note the OP asked for the sum of the digits being divisible by $14$, not the number itself. Your proof is basically correct, but there are $2$ things you should change. First, have $v$ and $w$ be the remainders of the number when divided by $14$. Second, your list of "mod" statements should end with $a + 4 + 9 mod 14$, with a statement that all of the possible remainders from $0$ to $13$ inclusive are included so, no matter the starting point, one of them needs to be equal to a multiple of $14$. Also, you may wish to provide a more detailed explanation for this part.
    $endgroup$
    – John Omielan
    Jan 2 at 2:01












  • $begingroup$
    @JohnOmielan See my revised answer.
    $endgroup$
    – Yiorgos S. Smyrlis
    Jan 2 at 13:01










  • $begingroup$
    Thanks for making the corrections. However, this might be a bit picky, but note your $2$ sets of mod statements are not quite correct at the end. This is because $w + 49 mod 14$ is not the same as $w + 4 + 9 mod 14$ as $49 - 4 - 9 = 36$ with $36 equiv{8} pmod{14}$. This is why I suggested my earlier change. However, here is a perhaps a slightly easier way to see this, & how I see it myself. Note you only need to use $0$ to $3$, then end with $4 + 0, ldots 4 + 9$ for $40$ to $49$, with this more simply & directly showing it covers all $0$ to $13$ values.
    $endgroup$
    – John Omielan
    Jan 2 at 17:57












  • $begingroup$
    One other thing you may wish to do is make it explicit why $100$ is the minimum value for this problem. It's because between $0$ to $49$, the span of $0$ to $13$ for the sum of digits is only achieved with the final value, i.e., $49$, giving $13$. Thus, there may be cases where a smaller set of consecutive set of integers don't have any which are a multiple of $14$. Note, however, I haven't tried to prove this rigorously myself (e.g., perhaps $99$ might still work), so I suggest you first confirm this yourself before potentially mentioning it.
    $endgroup$
    – John Omielan
    Jan 2 at 18:04


















  • $begingroup$
    Note the OP asked for the sum of the digits being divisible by $14$, not the number itself. Your proof is basically correct, but there are $2$ things you should change. First, have $v$ and $w$ be the remainders of the number when divided by $14$. Second, your list of "mod" statements should end with $a + 4 + 9 mod 14$, with a statement that all of the possible remainders from $0$ to $13$ inclusive are included so, no matter the starting point, one of them needs to be equal to a multiple of $14$. Also, you may wish to provide a more detailed explanation for this part.
    $endgroup$
    – John Omielan
    Jan 2 at 2:01












  • $begingroup$
    @JohnOmielan See my revised answer.
    $endgroup$
    – Yiorgos S. Smyrlis
    Jan 2 at 13:01










  • $begingroup$
    Thanks for making the corrections. However, this might be a bit picky, but note your $2$ sets of mod statements are not quite correct at the end. This is because $w + 49 mod 14$ is not the same as $w + 4 + 9 mod 14$ as $49 - 4 - 9 = 36$ with $36 equiv{8} pmod{14}$. This is why I suggested my earlier change. However, here is a perhaps a slightly easier way to see this, & how I see it myself. Note you only need to use $0$ to $3$, then end with $4 + 0, ldots 4 + 9$ for $40$ to $49$, with this more simply & directly showing it covers all $0$ to $13$ values.
    $endgroup$
    – John Omielan
    Jan 2 at 17:57












  • $begingroup$
    One other thing you may wish to do is make it explicit why $100$ is the minimum value for this problem. It's because between $0$ to $49$, the span of $0$ to $13$ for the sum of digits is only achieved with the final value, i.e., $49$, giving $13$. Thus, there may be cases where a smaller set of consecutive set of integers don't have any which are a multiple of $14$. Note, however, I haven't tried to prove this rigorously myself (e.g., perhaps $99$ might still work), so I suggest you first confirm this yourself before potentially mentioning it.
    $endgroup$
    – John Omielan
    Jan 2 at 18:04
















$begingroup$
Note the OP asked for the sum of the digits being divisible by $14$, not the number itself. Your proof is basically correct, but there are $2$ things you should change. First, have $v$ and $w$ be the remainders of the number when divided by $14$. Second, your list of "mod" statements should end with $a + 4 + 9 mod 14$, with a statement that all of the possible remainders from $0$ to $13$ inclusive are included so, no matter the starting point, one of them needs to be equal to a multiple of $14$. Also, you may wish to provide a more detailed explanation for this part.
$endgroup$
– John Omielan
Jan 2 at 2:01






$begingroup$
Note the OP asked for the sum of the digits being divisible by $14$, not the number itself. Your proof is basically correct, but there are $2$ things you should change. First, have $v$ and $w$ be the remainders of the number when divided by $14$. Second, your list of "mod" statements should end with $a + 4 + 9 mod 14$, with a statement that all of the possible remainders from $0$ to $13$ inclusive are included so, no matter the starting point, one of them needs to be equal to a multiple of $14$. Also, you may wish to provide a more detailed explanation for this part.
$endgroup$
– John Omielan
Jan 2 at 2:01














$begingroup$
@JohnOmielan See my revised answer.
$endgroup$
– Yiorgos S. Smyrlis
Jan 2 at 13:01




$begingroup$
@JohnOmielan See my revised answer.
$endgroup$
– Yiorgos S. Smyrlis
Jan 2 at 13:01












$begingroup$
Thanks for making the corrections. However, this might be a bit picky, but note your $2$ sets of mod statements are not quite correct at the end. This is because $w + 49 mod 14$ is not the same as $w + 4 + 9 mod 14$ as $49 - 4 - 9 = 36$ with $36 equiv{8} pmod{14}$. This is why I suggested my earlier change. However, here is a perhaps a slightly easier way to see this, & how I see it myself. Note you only need to use $0$ to $3$, then end with $4 + 0, ldots 4 + 9$ for $40$ to $49$, with this more simply & directly showing it covers all $0$ to $13$ values.
$endgroup$
– John Omielan
Jan 2 at 17:57






$begingroup$
Thanks for making the corrections. However, this might be a bit picky, but note your $2$ sets of mod statements are not quite correct at the end. This is because $w + 49 mod 14$ is not the same as $w + 4 + 9 mod 14$ as $49 - 4 - 9 = 36$ with $36 equiv{8} pmod{14}$. This is why I suggested my earlier change. However, here is a perhaps a slightly easier way to see this, & how I see it myself. Note you only need to use $0$ to $3$, then end with $4 + 0, ldots 4 + 9$ for $40$ to $49$, with this more simply & directly showing it covers all $0$ to $13$ values.
$endgroup$
– John Omielan
Jan 2 at 17:57














$begingroup$
One other thing you may wish to do is make it explicit why $100$ is the minimum value for this problem. It's because between $0$ to $49$, the span of $0$ to $13$ for the sum of digits is only achieved with the final value, i.e., $49$, giving $13$. Thus, there may be cases where a smaller set of consecutive set of integers don't have any which are a multiple of $14$. Note, however, I haven't tried to prove this rigorously myself (e.g., perhaps $99$ might still work), so I suggest you first confirm this yourself before potentially mentioning it.
$endgroup$
– John Omielan
Jan 2 at 18:04




$begingroup$
One other thing you may wish to do is make it explicit why $100$ is the minimum value for this problem. It's because between $0$ to $49$, the span of $0$ to $13$ for the sum of digits is only achieved with the final value, i.e., $49$, giving $13$. Thus, there may be cases where a smaller set of consecutive set of integers don't have any which are a multiple of $14$. Note, however, I haven't tried to prove this rigorously myself (e.g., perhaps $99$ might still work), so I suggest you first confirm this yourself before potentially mentioning it.
$endgroup$
– John Omielan
Jan 2 at 18:04


















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%2f3059026%2fprove-that-in-every-100-consecutive-integers-there-is-an-integer-whose-digits-su%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

Bressuire

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more

Cabo Verde

Image
  Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º) ...
Read more

Gyllenstierna

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more