Mixing
Let $T$ be the function that sum the digits of an integer $n$. Let $a (n)$ be the number of times we must...
$begingroup$
I'm currently working in the following exercise:
Let $T$ be the function that sum the digits of an integer $n$. Let $a (n)$ be the number of times we must apply $T$ to an integer n so that it becomes a fixed point. For example $a(452) = 2$, since $T (452) = 11$, $T (11) = 2$, $T (2) = 2$. So we must apply twice T to get to the fixed point $2$. Find the smallest positive integer $n$ such that $a (n) = 3$. Find the smallest positive integer n such that $a (n) = 4$.
I've been trying descomposition in prime factors so that could help me to find the numbers required to find the answer but that option is not working. If anyone has a hint or any help will be really appreciated.
number-theory elementary-number-theory
asked Jan 30 at 2:35
mrazmraz
44819
$endgroup$
add a comment |
$begingroup$
I'm currently working in the following exercise:
Let $T$ be the function that sum the digits of an integer $n$. Let $a (n)$ be the number of times we must apply $T$ to an integer n so that it becomes a fixed point. For example $a(452) = 2$, since $T (452) = 11$, $T (11) = 2$, $T (2) = 2$. So we must apply twice T to get to the fixed point $2$. Find the smallest positive integer $n$ such that $a (n) = 3$. Find the smallest positive integer n such that $a (n) = 4$.
I've been trying descomposition in prime factors so that could help me to find the numbers required to find the answer but that option is not working. If anyone has a hint or any help will be really appreciated.
number-theory elementary-number-theory
asked Jan 30 at 2:35
mrazmraz
44819
$endgroup$
2
$begingroup$
Prime factors has nothing to do with this. Find the smallest so that $a (n)=1$. That's clearly $10$. Find the smallest where $a(n)=2$ which is the smallest where the digits add to 10. That's clearly $19$ and so the smallest where $a (n)=3 is the smallest where the digits add to $19$ and that's 199. So the smallest where a (n)=4 will be the smallest where the digits add to 199. (It will have at least 22 digits so prime factors is definitely a useless idea).
$endgroup$
– fleablood
Jan 30 at 2:50
add a comment |
$begingroup$
I'm currently working in the following exercise:
Let $T$ be the function that sum the digits of an integer $n$. Let $a (n)$ be the number of times we must apply $T$ to an integer n so that it becomes a fixed point. For example $a(452) = 2$, since $T (452) = 11$, $T (11) = 2$, $T (2) = 2$. So we must apply twice T to get to the fixed point $2$. Find the smallest positive integer $n$ such that $a (n) = 3$. Find the smallest positive integer n such that $a (n) = 4$.
I've been trying descomposition in prime factors so that could help me to find the numbers required to find the answer but that option is not working. If anyone has a hint or any help will be really appreciated.
number-theory elementary-number-theory
asked Jan 30 at 2:35
mrazmraz
44819
$endgroup$
I'm currently working in the following exercise:
Let $T$ be the function that sum the digits of an integer $n$. Let $a (n)$ be the number of times we must apply $T$ to an integer n so that it becomes a fixed point. For example $a(452) = 2$, since $T (452) = 11$, $T (11) = 2$, $T (2) = 2$. So we must apply twice T to get to the fixed point $2$. Find the smallest positive integer $n$ such that $a (n) = 3$. Find the smallest positive integer n such that $a (n) = 4$.
I've been trying descomposition in prime factors so that could help me to find the numbers required to find the answer but that option is not working. If anyone has a hint or any help will be really appreciated.
number-theory elementary-number-theory
number-theory elementary-number-theory
asked Jan 30 at 2:35
mrazmraz
44819
asked Jan 30 at 2:35
mrazmraz
44819
edited Jan 30 at 2:42
mraz
asked Jan 30 at 2:35
mrazmraz
44819
asked Jan 30 at 2:35
mrazmraz
44819
asked Jan 30 at 2:35
mrazmraz
44819
44819
2
$begingroup$
Prime factors has nothing to do with this. Find the smallest so that $a (n)=1$. That's clearly $10$. Find the smallest where $a(n)=2$ which is the smallest where the digits add to 10. That's clearly $19$ and so the smallest where $a (n)=3 is the smallest where the digits add to $19$ and that's 199. So the smallest where a (n)=4 will be the smallest where the digits add to 199. (It will have at least 22 digits so prime factors is definitely a useless idea).
$endgroup$
– fleablood
Jan 30 at 2:50
add a comment |
2
$begingroup$
Prime factors has nothing to do with this. Find the smallest so that $a (n)=1$. That's clearly $10$. Find the smallest where $a(n)=2$ which is the smallest where the digits add to 10. That's clearly $19$ and so the smallest where $a (n)=3 is the smallest where the digits add to $19$ and that's 199. So the smallest where a (n)=4 will be the smallest where the digits add to 199. (It will have at least 22 digits so prime factors is definitely a useless idea).
$endgroup$
– fleablood
Jan 30 at 2:50
2
2
$begingroup$
Prime factors has nothing to do with this. Find the smallest so that $a (n)=1$. That's clearly $10$. Find the smallest where $a(n)=2$ which is the smallest where the digits add to 10. That's clearly $19$ and so the smallest where $a (n)=3 is the smallest where the digits add to $19$ and that's 199. So the smallest where a (n)=4 will be the smallest where the digits add to 199. (It will have at least 22 digits so prime factors is definitely a useless idea).
$endgroup$
– fleablood
Jan 30 at 2:50
$begingroup$
Prime factors has nothing to do with this. Find the smallest so that $a (n)=1$. That's clearly $10$. Find the smallest where $a(n)=2$ which is the smallest where the digits add to 10. That's clearly $19$ and so the smallest where $a (n)=3 is the smallest where the digits add to $19$ and that's 199. So the smallest where a (n)=4 will be the smallest where the digits add to 199. (It will have at least 22 digits so prime factors is definitely a useless idea).
$endgroup$
– fleablood
Jan 30 at 2:50
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Prime factorizations don't matter, digits do. So look at the smallest number such that $a(n)>0$.
Note that $T(d)=d$ for all single digits $d$, so try $T(10)=1$, so $a(10)=1$.
Going from here, we now know that if $T(n)=10$, then $a(n)=2$, since 10 is not a fixed point. To do that, simply make the digits sum to 10, and make the smallest number possible, which is $19$.
Next, if $T(n)=19$ then we know $a(n)=3$. I'll leave you to figure out what the smallest number that has a digit sum of 19 is.
answered Jan 30 at 2:48
obscuransobscurans
1,152311
$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: "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
});
}
});
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%2f3093032%2flet-t-be-the-function-that-sum-the-digits-of-an-integer-n-let-a-n-be-th%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
$begingroup$
Prime factorizations don't matter, digits do. So look at the smallest number such that $a(n)>0$.
Note that $T(d)=d$ for all single digits $d$, so try $T(10)=1$, so $a(10)=1$.
Going from here, we now know that if $T(n)=10$, then $a(n)=2$, since 10 is not a fixed point. To do that, simply make the digits sum to 10, and make the smallest number possible, which is $19$.
Next, if $T(n)=19$ then we know $a(n)=3$. I'll leave you to figure out what the smallest number that has a digit sum of 19 is.
answered Jan 30 at 2:48
obscuransobscurans
1,152311
$endgroup$
add a comment |
$begingroup$
Prime factorizations don't matter, digits do. So look at the smallest number such that $a(n)>0$.
Note that $T(d)=d$ for all single digits $d$, so try $T(10)=1$, so $a(10)=1$.
Going from here, we now know that if $T(n)=10$, then $a(n)=2$, since 10 is not a fixed point. To do that, simply make the digits sum to 10, and make the smallest number possible, which is $19$.
Next, if $T(n)=19$ then we know $a(n)=3$. I'll leave you to figure out what the smallest number that has a digit sum of 19 is.
answered Jan 30 at 2:48
obscuransobscurans
1,152311
$endgroup$
add a comment |
$begingroup$
Prime factorizations don't matter, digits do. So look at the smallest number such that $a(n)>0$.
Note that $T(d)=d$ for all single digits $d$, so try $T(10)=1$, so $a(10)=1$.
Going from here, we now know that if $T(n)=10$, then $a(n)=2$, since 10 is not a fixed point. To do that, simply make the digits sum to 10, and make the smallest number possible, which is $19$.
Next, if $T(n)=19$ then we know $a(n)=3$. I'll leave you to figure out what the smallest number that has a digit sum of 19 is.
answered Jan 30 at 2:48
obscuransobscurans
1,152311
$endgroup$
Prime factorizations don't matter, digits do. So look at the smallest number such that $a(n)>0$.
Note that $T(d)=d$ for all single digits $d$, so try $T(10)=1$, so $a(10)=1$.
Going from here, we now know that if $T(n)=10$, then $a(n)=2$, since 10 is not a fixed point. To do that, simply make the digits sum to 10, and make the smallest number possible, which is $19$.
Next, if $T(n)=19$ then we know $a(n)=3$. I'll leave you to figure out what the smallest number that has a digit sum of 19 is.
answered Jan 30 at 2:48
obscuransobscurans
1,152311
answered Jan 30 at 2:48
obscuransobscurans
1,152311
answered Jan 30 at 2:48
obscuransobscurans
1,152311
answered Jan 30 at 2:48
obscuransobscurans
1,152311
1,152311
add a comment |
add a comment |
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.
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%2f3093032%2flet-t-be-the-function-that-sum-the-digits-of-an-integer-n-let-a-n-be-th%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
2
$begingroup$
Prime factors has nothing to do with this. Find the smallest so that $a (n)=1$. That's clearly $10$. Find the smallest where $a(n)=2$ which is the smallest where the digits add to 10. That's clearly $19$ and so the smallest where $a (n)=3 is the smallest where the digits add to $19$ and that's 199. So the smallest where a (n)=4 will be the smallest where the digits add to 199. (It will have at least 22 digits so prime factors is definitely a useless idea).
$endgroup$
– fleablood
Jan 30 at 2:50