A relation of Kolomogrov complexity
up vote
0
down vote
favorite
Given a positive strictly monotonically increasing infinite sequence $n_1, n_2, dots$ with Kolmogorov complexity
$$K(n_i)geqlceillog_2 n_irceil/2,.$$
If $q_i$ is the greatest prime number that divides $n_i$, I've been asked to show to
show that the set $Q={q_i}_{i>0}$ is infinite. How do I do this?
My idea was to assume if it is finite, then we can write all $n_i=p_1^{r_1}...p_k^{r_k}$. So all the the information is encoded by $(r_1,...,r_k)$. We can recover the number by a program merely with input $r_1,...,r_k$. And I want to deduce such program can have length shorter that the given function.
computer-science formal-languages
asked Nov 16 at 15:41
CO2
1429
add a comment |
up vote
0
down vote
favorite
Given a positive strictly monotonically increasing infinite sequence $n_1, n_2, dots$ with Kolmogorov complexity
$$K(n_i)geqlceillog_2 n_irceil/2,.$$
If $q_i$ is the greatest prime number that divides $n_i$, I've been asked to show to
show that the set $Q={q_i}_{i>0}$ is infinite. How do I do this?
My idea was to assume if it is finite, then we can write all $n_i=p_1^{r_1}...p_k^{r_k}$. So all the the information is encoded by $(r_1,...,r_k)$. We can recover the number by a program merely with input $r_1,...,r_k$. And I want to deduce such program can have length shorter that the given function.
computer-science formal-languages
asked Nov 16 at 15:41
CO2
1429
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Given a positive strictly monotonically increasing infinite sequence $n_1, n_2, dots$ with Kolmogorov complexity
$$K(n_i)geqlceillog_2 n_irceil/2,.$$
If $q_i$ is the greatest prime number that divides $n_i$, I've been asked to show to
show that the set $Q={q_i}_{i>0}$ is infinite. How do I do this?
My idea was to assume if it is finite, then we can write all $n_i=p_1^{r_1}...p_k^{r_k}$. So all the the information is encoded by $(r_1,...,r_k)$. We can recover the number by a program merely with input $r_1,...,r_k$. And I want to deduce such program can have length shorter that the given function.
computer-science formal-languages
asked Nov 16 at 15:41
CO2
1429
Given a positive strictly monotonically increasing infinite sequence $n_1, n_2, dots$ with Kolmogorov complexity
$$K(n_i)geqlceillog_2 n_irceil/2,.$$
If $q_i$ is the greatest prime number that divides $n_i$, I've been asked to show to
show that the set $Q={q_i}_{i>0}$ is infinite. How do I do this?
My idea was to assume if it is finite, then we can write all $n_i=p_1^{r_1}...p_k^{r_k}$. So all the the information is encoded by $(r_1,...,r_k)$. We can recover the number by a program merely with input $r_1,...,r_k$. And I want to deduce such program can have length shorter that the given function.
computer-science formal-languages
computer-science formal-languages
asked Nov 16 at 15:41
CO2
1429
asked Nov 16 at 15:41
CO2
1429
asked Nov 16 at 15:41
CO2
1429
asked Nov 16 at 15:41
CO2
1429
asked Nov 16 at 15:41
CO2
1429
1429
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2fmath.stackexchange.com%2fquestions%2f3001282%2fa-relation-of-kolomogrov-complexity%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
