Tricky question related to sequences and series












2












$begingroup$


I have the following question with me:



"In the sequence $$1,9,7,7,4,7,5,3,9,4,1,....$$ every term from the fifth one is the sum of the previous 4 modulo 10. Do the numbers $1977$(apart from beginning) and $0197$ ever occur in the sequence? If yes, does it occur a finite number of times or not?"



How do I solve this question? The only advancement I have made is that when the sequence is written modulo 2, I get $$1,1,1,1,0,1,1,1,1,0....$$



How do I proceed from here?






sequences-and-series number-theory







share|cite|improve this question









$endgroup$












  • $begingroup$
    Did you look for a period of this sequence ?
    $endgroup$
    – Peter
    Dec 15 '18 at 8:15










  • $begingroup$
    You can work backwards as well as forwards to see if that tells you anything. $2$ is an interesting modulus to choose because it is a factor of $10$.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 10:38
















2












$begingroup$


I have the following question with me:



"In the sequence $$1,9,7,7,4,7,5,3,9,4,1,....$$ every term from the fifth one is the sum of the previous 4 modulo 10. Do the numbers $1977$(apart from beginning) and $0197$ ever occur in the sequence? If yes, does it occur a finite number of times or not?"



How do I solve this question? The only advancement I have made is that when the sequence is written modulo 2, I get $$1,1,1,1,0,1,1,1,1,0....$$



How do I proceed from here?






sequences-and-series number-theory







share|cite|improve this question









$endgroup$












  • $begingroup$
    Did you look for a period of this sequence ?
    $endgroup$
    – Peter
    Dec 15 '18 at 8:15










  • $begingroup$
    You can work backwards as well as forwards to see if that tells you anything. $2$ is an interesting modulus to choose because it is a factor of $10$.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 10:38














2












2








2


0



$begingroup$


I have the following question with me:



"In the sequence $$1,9,7,7,4,7,5,3,9,4,1,....$$ every term from the fifth one is the sum of the previous 4 modulo 10. Do the numbers $1977$(apart from beginning) and $0197$ ever occur in the sequence? If yes, does it occur a finite number of times or not?"



How do I solve this question? The only advancement I have made is that when the sequence is written modulo 2, I get $$1,1,1,1,0,1,1,1,1,0....$$



How do I proceed from here?






sequences-and-series number-theory







share|cite|improve this question









$endgroup$




I have the following question with me:



"In the sequence $$1,9,7,7,4,7,5,3,9,4,1,....$$ every term from the fifth one is the sum of the previous 4 modulo 10. Do the numbers $1977$(apart from beginning) and $0197$ ever occur in the sequence? If yes, does it occur a finite number of times or not?"



How do I solve this question? The only advancement I have made is that when the sequence is written modulo 2, I get $$1,1,1,1,0,1,1,1,1,0....$$



How do I proceed from here?






sequences-and-series number-theory




sequences-and-series number-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 15 '18 at 8:08









saisanjeevsaisanjeev

997212




997212












  • $begingroup$
    Did you look for a period of this sequence ?
    $endgroup$
    – Peter
    Dec 15 '18 at 8:15










  • $begingroup$
    You can work backwards as well as forwards to see if that tells you anything. $2$ is an interesting modulus to choose because it is a factor of $10$.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 10:38


















  • $begingroup$
    Did you look for a period of this sequence ?
    $endgroup$
    – Peter
    Dec 15 '18 at 8:15










  • $begingroup$
    You can work backwards as well as forwards to see if that tells you anything. $2$ is an interesting modulus to choose because it is a factor of $10$.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 10:38
















$begingroup$
Did you look for a period of this sequence ?
$endgroup$
– Peter
Dec 15 '18 at 8:15




$begingroup$
Did you look for a period of this sequence ?
$endgroup$
– Peter
Dec 15 '18 at 8:15












$begingroup$
You can work backwards as well as forwards to see if that tells you anything. $2$ is an interesting modulus to choose because it is a factor of $10$.
$endgroup$
– Mark Bennet
Dec 15 '18 at 10:38




$begingroup$
You can work backwards as well as forwards to see if that tells you anything. $2$ is an interesting modulus to choose because it is a factor of $10$.
$endgroup$
– Mark Bennet
Dec 15 '18 at 10:38










2 Answers
2






active

oldest

votes


















0












$begingroup$

Hint: you can prove results about sequences like this without explicitly computing anything using two facts:




  1. The number of possible sequences of four digits is finite, while the sequence you are given is infinite.


  2. Any four consecutive digits in the sequence (uniquely) determine the whole sequence both forwards and backwards



Obviously you have to show that these facts are true for the sequence in hand, and then work out how to use them to get the result you need.




The things about explicitly computing residues can help in determining the period of a recurring sequence.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Yes that works and helps me to prove that a certain number will occur infinitely many times. However, I can tell that if I know for a fact that that 4 tuple occurs at least once. I can do that for the first one coz I know 1977 occurs once in the sequence. But how do I solve the second part?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 11:21










  • $begingroup$
    @saisanjeev Think about when the first repetition happens, and try working backwards.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 11:38










  • $begingroup$
    I still didnt understand how to proceed? Can you please elaborate
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 14:32










  • $begingroup$
    @saisanjeev Suppose you get a first repeat at positions $m, m+1, m+2, m+3$ and $n, n+1, n+2, n+3$ - what can you say about positions $m-1$ and $n-1$?
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 16:05












  • $begingroup$
    m-1 and n-1 would be the same. But to prove that 0197 will occur infinite number of times, I need to prove that it will occur at least once. How do I prove that?
    $endgroup$
    – saisanjeev
    Dec 18 '18 at 15:12



















-1












$begingroup$

First, you can consider the sequence with index in whole integers. For example, we can define $a_{0} = 0$ since $0 + 1 + 9 + 7equiv 7$ mod 10 and $a_{-1} = 7$ since $7 + 0 + 1 + 9 equiv 7$ mod 10. Now try to explain that there exists $mneq n$ such that $(a_{m}, a_{m+1}, a_{m+2}, a_{m+3}) = (a_{n}, a_{n+1}, a_{n+2}, a_{n+3})$ by using the pigeonhole principle.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    I went ahead like this, please tell whether the method is right. The number of 4-tuples of numbers are only 10^4, however, since the sequence is infinite, one of the sequences will eventually repeat, since the next term of the sequence is determined by the previous four, once one of them repeats, the sequence will repeat itself, is the proof correct?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 9:36










  • $begingroup$
    @saisanjeev Exactly what I mean.
    $endgroup$
    – Seewoo Lee
    Dec 16 '18 at 2:52










  • $begingroup$
    The pigeonhole principle says there are repeats, but you also have to prove that particular sequences repeat, and this argument does not even show that if a sequence appears once it necessarily repeats.
    $endgroup$
    – Mark Bennet
    Dec 18 '18 at 17:16










  • $begingroup$
    @Mark Bennet I didn’t try to give a full solution. Since there is quadruple that repeats, by the recurrence relation it should be periodic so that every quadruple repeats. Now it is fairly obvious that 1,9,7,7 and 0,1,9,7 are in the sequence (actually I already mentioned in the hint). I don’t think it is always good to give a full solution.
    $endgroup$
    – Seewoo Lee
    Dec 19 '18 at 0:30











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%2f3040263%2ftricky-question-related-to-sequences-and-series%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









0












$begingroup$

Hint: you can prove results about sequences like this without explicitly computing anything using two facts:




  1. The number of possible sequences of four digits is finite, while the sequence you are given is infinite.


  2. Any four consecutive digits in the sequence (uniquely) determine the whole sequence both forwards and backwards



Obviously you have to show that these facts are true for the sequence in hand, and then work out how to use them to get the result you need.




The things about explicitly computing residues can help in determining the period of a recurring sequence.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Yes that works and helps me to prove that a certain number will occur infinitely many times. However, I can tell that if I know for a fact that that 4 tuple occurs at least once. I can do that for the first one coz I know 1977 occurs once in the sequence. But how do I solve the second part?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 11:21










  • $begingroup$
    @saisanjeev Think about when the first repetition happens, and try working backwards.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 11:38










  • $begingroup$
    I still didnt understand how to proceed? Can you please elaborate
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 14:32










  • $begingroup$
    @saisanjeev Suppose you get a first repeat at positions $m, m+1, m+2, m+3$ and $n, n+1, n+2, n+3$ - what can you say about positions $m-1$ and $n-1$?
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 16:05












  • $begingroup$
    m-1 and n-1 would be the same. But to prove that 0197 will occur infinite number of times, I need to prove that it will occur at least once. How do I prove that?
    $endgroup$
    – saisanjeev
    Dec 18 '18 at 15:12
















0












$begingroup$

Hint: you can prove results about sequences like this without explicitly computing anything using two facts:




  1. The number of possible sequences of four digits is finite, while the sequence you are given is infinite.


  2. Any four consecutive digits in the sequence (uniquely) determine the whole sequence both forwards and backwards



Obviously you have to show that these facts are true for the sequence in hand, and then work out how to use them to get the result you need.




The things about explicitly computing residues can help in determining the period of a recurring sequence.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Yes that works and helps me to prove that a certain number will occur infinitely many times. However, I can tell that if I know for a fact that that 4 tuple occurs at least once. I can do that for the first one coz I know 1977 occurs once in the sequence. But how do I solve the second part?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 11:21










  • $begingroup$
    @saisanjeev Think about when the first repetition happens, and try working backwards.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 11:38










  • $begingroup$
    I still didnt understand how to proceed? Can you please elaborate
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 14:32










  • $begingroup$
    @saisanjeev Suppose you get a first repeat at positions $m, m+1, m+2, m+3$ and $n, n+1, n+2, n+3$ - what can you say about positions $m-1$ and $n-1$?
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 16:05












  • $begingroup$
    m-1 and n-1 would be the same. But to prove that 0197 will occur infinite number of times, I need to prove that it will occur at least once. How do I prove that?
    $endgroup$
    – saisanjeev
    Dec 18 '18 at 15:12














0












0








0





$begingroup$

Hint: you can prove results about sequences like this without explicitly computing anything using two facts:




  1. The number of possible sequences of four digits is finite, while the sequence you are given is infinite.


  2. Any four consecutive digits in the sequence (uniquely) determine the whole sequence both forwards and backwards



Obviously you have to show that these facts are true for the sequence in hand, and then work out how to use them to get the result you need.




The things about explicitly computing residues can help in determining the period of a recurring sequence.






share|cite|improve this answer









$endgroup$



Hint: you can prove results about sequences like this without explicitly computing anything using two facts:




  1. The number of possible sequences of four digits is finite, while the sequence you are given is infinite.


  2. Any four consecutive digits in the sequence (uniquely) determine the whole sequence both forwards and backwards



Obviously you have to show that these facts are true for the sequence in hand, and then work out how to use them to get the result you need.




The things about explicitly computing residues can help in determining the period of a recurring sequence.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 15 '18 at 11:10









Mark BennetMark Bennet

81.4k983180




81.4k983180












  • $begingroup$
    Yes that works and helps me to prove that a certain number will occur infinitely many times. However, I can tell that if I know for a fact that that 4 tuple occurs at least once. I can do that for the first one coz I know 1977 occurs once in the sequence. But how do I solve the second part?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 11:21










  • $begingroup$
    @saisanjeev Think about when the first repetition happens, and try working backwards.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 11:38










  • $begingroup$
    I still didnt understand how to proceed? Can you please elaborate
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 14:32










  • $begingroup$
    @saisanjeev Suppose you get a first repeat at positions $m, m+1, m+2, m+3$ and $n, n+1, n+2, n+3$ - what can you say about positions $m-1$ and $n-1$?
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 16:05












  • $begingroup$
    m-1 and n-1 would be the same. But to prove that 0197 will occur infinite number of times, I need to prove that it will occur at least once. How do I prove that?
    $endgroup$
    – saisanjeev
    Dec 18 '18 at 15:12


















  • $begingroup$
    Yes that works and helps me to prove that a certain number will occur infinitely many times. However, I can tell that if I know for a fact that that 4 tuple occurs at least once. I can do that for the first one coz I know 1977 occurs once in the sequence. But how do I solve the second part?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 11:21










  • $begingroup$
    @saisanjeev Think about when the first repetition happens, and try working backwards.
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 11:38










  • $begingroup$
    I still didnt understand how to proceed? Can you please elaborate
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 14:32










  • $begingroup$
    @saisanjeev Suppose you get a first repeat at positions $m, m+1, m+2, m+3$ and $n, n+1, n+2, n+3$ - what can you say about positions $m-1$ and $n-1$?
    $endgroup$
    – Mark Bennet
    Dec 15 '18 at 16:05












  • $begingroup$
    m-1 and n-1 would be the same. But to prove that 0197 will occur infinite number of times, I need to prove that it will occur at least once. How do I prove that?
    $endgroup$
    – saisanjeev
    Dec 18 '18 at 15:12
















$begingroup$
Yes that works and helps me to prove that a certain number will occur infinitely many times. However, I can tell that if I know for a fact that that 4 tuple occurs at least once. I can do that for the first one coz I know 1977 occurs once in the sequence. But how do I solve the second part?
$endgroup$
– saisanjeev
Dec 15 '18 at 11:21




$begingroup$
Yes that works and helps me to prove that a certain number will occur infinitely many times. However, I can tell that if I know for a fact that that 4 tuple occurs at least once. I can do that for the first one coz I know 1977 occurs once in the sequence. But how do I solve the second part?
$endgroup$
– saisanjeev
Dec 15 '18 at 11:21












$begingroup$
@saisanjeev Think about when the first repetition happens, and try working backwards.
$endgroup$
– Mark Bennet
Dec 15 '18 at 11:38




$begingroup$
@saisanjeev Think about when the first repetition happens, and try working backwards.
$endgroup$
– Mark Bennet
Dec 15 '18 at 11:38












$begingroup$
I still didnt understand how to proceed? Can you please elaborate
$endgroup$
– saisanjeev
Dec 15 '18 at 14:32




$begingroup$
I still didnt understand how to proceed? Can you please elaborate
$endgroup$
– saisanjeev
Dec 15 '18 at 14:32












$begingroup$
@saisanjeev Suppose you get a first repeat at positions $m, m+1, m+2, m+3$ and $n, n+1, n+2, n+3$ - what can you say about positions $m-1$ and $n-1$?
$endgroup$
– Mark Bennet
Dec 15 '18 at 16:05






$begingroup$
@saisanjeev Suppose you get a first repeat at positions $m, m+1, m+2, m+3$ and $n, n+1, n+2, n+3$ - what can you say about positions $m-1$ and $n-1$?
$endgroup$
– Mark Bennet
Dec 15 '18 at 16:05














$begingroup$
m-1 and n-1 would be the same. But to prove that 0197 will occur infinite number of times, I need to prove that it will occur at least once. How do I prove that?
$endgroup$
– saisanjeev
Dec 18 '18 at 15:12




$begingroup$
m-1 and n-1 would be the same. But to prove that 0197 will occur infinite number of times, I need to prove that it will occur at least once. How do I prove that?
$endgroup$
– saisanjeev
Dec 18 '18 at 15:12











-1












$begingroup$

First, you can consider the sequence with index in whole integers. For example, we can define $a_{0} = 0$ since $0 + 1 + 9 + 7equiv 7$ mod 10 and $a_{-1} = 7$ since $7 + 0 + 1 + 9 equiv 7$ mod 10. Now try to explain that there exists $mneq n$ such that $(a_{m}, a_{m+1}, a_{m+2}, a_{m+3}) = (a_{n}, a_{n+1}, a_{n+2}, a_{n+3})$ by using the pigeonhole principle.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    I went ahead like this, please tell whether the method is right. The number of 4-tuples of numbers are only 10^4, however, since the sequence is infinite, one of the sequences will eventually repeat, since the next term of the sequence is determined by the previous four, once one of them repeats, the sequence will repeat itself, is the proof correct?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 9:36










  • $begingroup$
    @saisanjeev Exactly what I mean.
    $endgroup$
    – Seewoo Lee
    Dec 16 '18 at 2:52










  • $begingroup$
    The pigeonhole principle says there are repeats, but you also have to prove that particular sequences repeat, and this argument does not even show that if a sequence appears once it necessarily repeats.
    $endgroup$
    – Mark Bennet
    Dec 18 '18 at 17:16










  • $begingroup$
    @Mark Bennet I didn’t try to give a full solution. Since there is quadruple that repeats, by the recurrence relation it should be periodic so that every quadruple repeats. Now it is fairly obvious that 1,9,7,7 and 0,1,9,7 are in the sequence (actually I already mentioned in the hint). I don’t think it is always good to give a full solution.
    $endgroup$
    – Seewoo Lee
    Dec 19 '18 at 0:30
















-1












$begingroup$

First, you can consider the sequence with index in whole integers. For example, we can define $a_{0} = 0$ since $0 + 1 + 9 + 7equiv 7$ mod 10 and $a_{-1} = 7$ since $7 + 0 + 1 + 9 equiv 7$ mod 10. Now try to explain that there exists $mneq n$ such that $(a_{m}, a_{m+1}, a_{m+2}, a_{m+3}) = (a_{n}, a_{n+1}, a_{n+2}, a_{n+3})$ by using the pigeonhole principle.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    I went ahead like this, please tell whether the method is right. The number of 4-tuples of numbers are only 10^4, however, since the sequence is infinite, one of the sequences will eventually repeat, since the next term of the sequence is determined by the previous four, once one of them repeats, the sequence will repeat itself, is the proof correct?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 9:36










  • $begingroup$
    @saisanjeev Exactly what I mean.
    $endgroup$
    – Seewoo Lee
    Dec 16 '18 at 2:52










  • $begingroup$
    The pigeonhole principle says there are repeats, but you also have to prove that particular sequences repeat, and this argument does not even show that if a sequence appears once it necessarily repeats.
    $endgroup$
    – Mark Bennet
    Dec 18 '18 at 17:16










  • $begingroup$
    @Mark Bennet I didn’t try to give a full solution. Since there is quadruple that repeats, by the recurrence relation it should be periodic so that every quadruple repeats. Now it is fairly obvious that 1,9,7,7 and 0,1,9,7 are in the sequence (actually I already mentioned in the hint). I don’t think it is always good to give a full solution.
    $endgroup$
    – Seewoo Lee
    Dec 19 '18 at 0:30














-1












-1








-1





$begingroup$

First, you can consider the sequence with index in whole integers. For example, we can define $a_{0} = 0$ since $0 + 1 + 9 + 7equiv 7$ mod 10 and $a_{-1} = 7$ since $7 + 0 + 1 + 9 equiv 7$ mod 10. Now try to explain that there exists $mneq n$ such that $(a_{m}, a_{m+1}, a_{m+2}, a_{m+3}) = (a_{n}, a_{n+1}, a_{n+2}, a_{n+3})$ by using the pigeonhole principle.






share|cite|improve this answer









$endgroup$



First, you can consider the sequence with index in whole integers. For example, we can define $a_{0} = 0$ since $0 + 1 + 9 + 7equiv 7$ mod 10 and $a_{-1} = 7$ since $7 + 0 + 1 + 9 equiv 7$ mod 10. Now try to explain that there exists $mneq n$ such that $(a_{m}, a_{m+1}, a_{m+2}, a_{m+3}) = (a_{n}, a_{n+1}, a_{n+2}, a_{n+3})$ by using the pigeonhole principle.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 15 '18 at 8:20









Seewoo LeeSeewoo Lee

6,969927




6,969927












  • $begingroup$
    I went ahead like this, please tell whether the method is right. The number of 4-tuples of numbers are only 10^4, however, since the sequence is infinite, one of the sequences will eventually repeat, since the next term of the sequence is determined by the previous four, once one of them repeats, the sequence will repeat itself, is the proof correct?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 9:36










  • $begingroup$
    @saisanjeev Exactly what I mean.
    $endgroup$
    – Seewoo Lee
    Dec 16 '18 at 2:52










  • $begingroup$
    The pigeonhole principle says there are repeats, but you also have to prove that particular sequences repeat, and this argument does not even show that if a sequence appears once it necessarily repeats.
    $endgroup$
    – Mark Bennet
    Dec 18 '18 at 17:16










  • $begingroup$
    @Mark Bennet I didn’t try to give a full solution. Since there is quadruple that repeats, by the recurrence relation it should be periodic so that every quadruple repeats. Now it is fairly obvious that 1,9,7,7 and 0,1,9,7 are in the sequence (actually I already mentioned in the hint). I don’t think it is always good to give a full solution.
    $endgroup$
    – Seewoo Lee
    Dec 19 '18 at 0:30


















  • $begingroup$
    I went ahead like this, please tell whether the method is right. The number of 4-tuples of numbers are only 10^4, however, since the sequence is infinite, one of the sequences will eventually repeat, since the next term of the sequence is determined by the previous four, once one of them repeats, the sequence will repeat itself, is the proof correct?
    $endgroup$
    – saisanjeev
    Dec 15 '18 at 9:36










  • $begingroup$
    @saisanjeev Exactly what I mean.
    $endgroup$
    – Seewoo Lee
    Dec 16 '18 at 2:52










  • $begingroup$
    The pigeonhole principle says there are repeats, but you also have to prove that particular sequences repeat, and this argument does not even show that if a sequence appears once it necessarily repeats.
    $endgroup$
    – Mark Bennet
    Dec 18 '18 at 17:16










  • $begingroup$
    @Mark Bennet I didn’t try to give a full solution. Since there is quadruple that repeats, by the recurrence relation it should be periodic so that every quadruple repeats. Now it is fairly obvious that 1,9,7,7 and 0,1,9,7 are in the sequence (actually I already mentioned in the hint). I don’t think it is always good to give a full solution.
    $endgroup$
    – Seewoo Lee
    Dec 19 '18 at 0:30
















$begingroup$
I went ahead like this, please tell whether the method is right. The number of 4-tuples of numbers are only 10^4, however, since the sequence is infinite, one of the sequences will eventually repeat, since the next term of the sequence is determined by the previous four, once one of them repeats, the sequence will repeat itself, is the proof correct?
$endgroup$
– saisanjeev
Dec 15 '18 at 9:36




$begingroup$
I went ahead like this, please tell whether the method is right. The number of 4-tuples of numbers are only 10^4, however, since the sequence is infinite, one of the sequences will eventually repeat, since the next term of the sequence is determined by the previous four, once one of them repeats, the sequence will repeat itself, is the proof correct?
$endgroup$
– saisanjeev
Dec 15 '18 at 9:36












$begingroup$
@saisanjeev Exactly what I mean.
$endgroup$
– Seewoo Lee
Dec 16 '18 at 2:52




$begingroup$
@saisanjeev Exactly what I mean.
$endgroup$
– Seewoo Lee
Dec 16 '18 at 2:52












$begingroup$
The pigeonhole principle says there are repeats, but you also have to prove that particular sequences repeat, and this argument does not even show that if a sequence appears once it necessarily repeats.
$endgroup$
– Mark Bennet
Dec 18 '18 at 17:16




$begingroup$
The pigeonhole principle says there are repeats, but you also have to prove that particular sequences repeat, and this argument does not even show that if a sequence appears once it necessarily repeats.
$endgroup$
– Mark Bennet
Dec 18 '18 at 17:16












$begingroup$
@Mark Bennet I didn’t try to give a full solution. Since there is quadruple that repeats, by the recurrence relation it should be periodic so that every quadruple repeats. Now it is fairly obvious that 1,9,7,7 and 0,1,9,7 are in the sequence (actually I already mentioned in the hint). I don’t think it is always good to give a full solution.
$endgroup$
– Seewoo Lee
Dec 19 '18 at 0:30




$begingroup$
@Mark Bennet I didn’t try to give a full solution. Since there is quadruple that repeats, by the recurrence relation it should be periodic so that every quadruple repeats. Now it is fairly obvious that 1,9,7,7 and 0,1,9,7 are in the sequence (actually I already mentioned in the hint). I don’t think it is always good to give a full solution.
$endgroup$
– Seewoo Lee
Dec 19 '18 at 0:30


















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%2f3040263%2ftricky-question-related-to-sequences-and-series%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

Bundesstraße 106

Image
Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück ...
Read more

Verónica Boquete

Image
Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl ...
Read more

Ida-Boy-Ed-Garten

Image
Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich ...
Read more