Recursion: computing $f(3^100)$Recursion function question againcomputer theory recursionMaths/Programming recursion questionA Problem about RecursionHow to solve recursion?Lin Alg 100-Level Recursion ProblemSolve this recursionA positive integer is equal to the sum of digits of a multiple of itself.Recursion RelationsKilling Flies with a Checkerboard Flyswatter
GFCI outlets - can they be repaired? Are they really needed at the end of a circuit?
Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?
What historical events would have to change in order to make 19th century "steampunk" technology possible?
Is it "common practice in Fourier transform spectroscopy to multiply the measured interferogram by an apodizing function"? If so, why?
Could the museum Saturn V's be refitted for one more flight?
Why was the shrink from 8″ made only to 5.25″ and not smaller (4″ or less)
How to remove border from elements in the last row?
Finding the error in an argument
Do Iron Man suits sport waste management systems?
How many wives did king shaul have
Venezuelan girlfriend wants to travel the USA to be with me. What is the process?
Is there a hemisphere-neutral way of specifying a season?
Is it possible to create a QR code using text?
Notepad++ delete until colon for every line with replace all
What is the opposite of "eschatology"?
What are the G forces leaving Earth orbit?
Rotate ASCII Art by 45 Degrees
What is an equivalently powerful replacement spell for the Yuan-Ti's Suggestion spell?
Fair gambler's ruin problem intuition
How can I deal with my CEO asking me to hire someone with a higher salary than me, a co-founder?
Forgetting the musical notes while performing in concert
In Bayesian inference, why are some terms dropped from the posterior predictive?
How to install cross-compiler on Ubuntu 18.04?
What reasons are there for a Capitalist to oppose a 100% inheritance tax?
Recursion: computing $f(3^100)$
Recursion function question againcomputer theory recursionMaths/Programming recursion questionA Problem about RecursionHow to solve recursion?Lin Alg 100-Level Recursion ProblemSolve this recursionA positive integer is equal to the sum of digits of a multiple of itself.Recursion RelationsKilling Flies with a Checkerboard Flyswatter
$begingroup$
Given the function $f:N^+ rightarrow N$ such that: $f(2^n)=n^2$, $f(3n)=f(2n)+5$, Find the value of $f(3^100)$:
I tried calculating some smaller $f(3^k)$ for integer $k$, to look for a pattern, If I haven't done silly mistakes I got:$$f(3)=6,f(3^2)=9,f(3^3)=24,f(3^4)=36$$
I noticed that $f(3)cdot4=f(3^3)$ and $f(3^2)cdot4=f(3^4)$, nonetheless, I don't think this kind of pattern holds, I wrote in general that: $$f(3cdot2^n)=n^2+2n+6$$
Hints or partial help is much appreciated!
contest-math recursion
$endgroup$
add a comment |
$begingroup$
Given the function $f:N^+ rightarrow N$ such that: $f(2^n)=n^2$, $f(3n)=f(2n)+5$, Find the value of $f(3^100)$:
I tried calculating some smaller $f(3^k)$ for integer $k$, to look for a pattern, If I haven't done silly mistakes I got:$$f(3)=6,f(3^2)=9,f(3^3)=24,f(3^4)=36$$
I noticed that $f(3)cdot4=f(3^3)$ and $f(3^2)cdot4=f(3^4)$, nonetheless, I don't think this kind of pattern holds, I wrote in general that: $$f(3cdot2^n)=n^2+2n+6$$
Hints or partial help is much appreciated!
contest-math recursion
$endgroup$
$begingroup$
Let me know if I made some silly mistake!
$endgroup$
– Spasoje Durovic
Mar 20 at 19:55
add a comment |
$begingroup$
Given the function $f:N^+ rightarrow N$ such that: $f(2^n)=n^2$, $f(3n)=f(2n)+5$, Find the value of $f(3^100)$:
I tried calculating some smaller $f(3^k)$ for integer $k$, to look for a pattern, If I haven't done silly mistakes I got:$$f(3)=6,f(3^2)=9,f(3^3)=24,f(3^4)=36$$
I noticed that $f(3)cdot4=f(3^3)$ and $f(3^2)cdot4=f(3^4)$, nonetheless, I don't think this kind of pattern holds, I wrote in general that: $$f(3cdot2^n)=n^2+2n+6$$
Hints or partial help is much appreciated!
contest-math recursion
$endgroup$
Given the function $f:N^+ rightarrow N$ such that: $f(2^n)=n^2$, $f(3n)=f(2n)+5$, Find the value of $f(3^100)$:
I tried calculating some smaller $f(3^k)$ for integer $k$, to look for a pattern, If I haven't done silly mistakes I got:$$f(3)=6,f(3^2)=9,f(3^3)=24,f(3^4)=36$$
I noticed that $f(3)cdot4=f(3^3)$ and $f(3^2)cdot4=f(3^4)$, nonetheless, I don't think this kind of pattern holds, I wrote in general that: $$f(3cdot2^n)=n^2+2n+6$$
Hints or partial help is much appreciated!
contest-math recursion
contest-math recursion
asked Mar 20 at 19:54
Spasoje DurovicSpasoje Durovic
40811
40811
$begingroup$
Let me know if I made some silly mistake!
$endgroup$
– Spasoje Durovic
Mar 20 at 19:55
add a comment |
$begingroup$
Let me know if I made some silly mistake!
$endgroup$
– Spasoje Durovic
Mar 20 at 19:55
$begingroup$
Let me know if I made some silly mistake!
$endgroup$
– Spasoje Durovic
Mar 20 at 19:55
$begingroup$
Let me know if I made some silly mistake!
$endgroup$
– Spasoje Durovic
Mar 20 at 19:55
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You can easily show by induction that for all $n in lbrace 0, ..., 100 rbrace$,
$$f(3^100)=f(2^n times 3^100-n) + 5n$$
Using that with $n=100$, you get
$$f(3^100) = f(2^100) + 500 = 100^2+ 500 = 10500$$
$endgroup$
$begingroup$
$f(3^100)=f(3.3^99)=f(2.3^99)+5 = f(3.(2.3^98))+5 = f(2.2.3^98) + 5+5 = f(2^2.3^98)+2times5 = ...$ and so on.
$endgroup$
– TheSilverDoe
Mar 20 at 20:10
$begingroup$
Right! I had deleted my comment because I was trying exactly that! great, thanks
$endgroup$
– Spasoje Durovic
Mar 20 at 20:11
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%2f3155934%2frecursion-computing-f3100%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$
You can easily show by induction that for all $n in lbrace 0, ..., 100 rbrace$,
$$f(3^100)=f(2^n times 3^100-n) + 5n$$
Using that with $n=100$, you get
$$f(3^100) = f(2^100) + 500 = 100^2+ 500 = 10500$$
$endgroup$
$begingroup$
$f(3^100)=f(3.3^99)=f(2.3^99)+5 = f(3.(2.3^98))+5 = f(2.2.3^98) + 5+5 = f(2^2.3^98)+2times5 = ...$ and so on.
$endgroup$
– TheSilverDoe
Mar 20 at 20:10
$begingroup$
Right! I had deleted my comment because I was trying exactly that! great, thanks
$endgroup$
– Spasoje Durovic
Mar 20 at 20:11
add a comment |
$begingroup$
You can easily show by induction that for all $n in lbrace 0, ..., 100 rbrace$,
$$f(3^100)=f(2^n times 3^100-n) + 5n$$
Using that with $n=100$, you get
$$f(3^100) = f(2^100) + 500 = 100^2+ 500 = 10500$$
$endgroup$
$begingroup$
$f(3^100)=f(3.3^99)=f(2.3^99)+5 = f(3.(2.3^98))+5 = f(2.2.3^98) + 5+5 = f(2^2.3^98)+2times5 = ...$ and so on.
$endgroup$
– TheSilverDoe
Mar 20 at 20:10
$begingroup$
Right! I had deleted my comment because I was trying exactly that! great, thanks
$endgroup$
– Spasoje Durovic
Mar 20 at 20:11
add a comment |
$begingroup$
You can easily show by induction that for all $n in lbrace 0, ..., 100 rbrace$,
$$f(3^100)=f(2^n times 3^100-n) + 5n$$
Using that with $n=100$, you get
$$f(3^100) = f(2^100) + 500 = 100^2+ 500 = 10500$$
$endgroup$
You can easily show by induction that for all $n in lbrace 0, ..., 100 rbrace$,
$$f(3^100)=f(2^n times 3^100-n) + 5n$$
Using that with $n=100$, you get
$$f(3^100) = f(2^100) + 500 = 100^2+ 500 = 10500$$
answered Mar 20 at 20:02
TheSilverDoeTheSilverDoe
5,066215
5,066215
$begingroup$
$f(3^100)=f(3.3^99)=f(2.3^99)+5 = f(3.(2.3^98))+5 = f(2.2.3^98) + 5+5 = f(2^2.3^98)+2times5 = ...$ and so on.
$endgroup$
– TheSilverDoe
Mar 20 at 20:10
$begingroup$
Right! I had deleted my comment because I was trying exactly that! great, thanks
$endgroup$
– Spasoje Durovic
Mar 20 at 20:11
add a comment |
$begingroup$
$f(3^100)=f(3.3^99)=f(2.3^99)+5 = f(3.(2.3^98))+5 = f(2.2.3^98) + 5+5 = f(2^2.3^98)+2times5 = ...$ and so on.
$endgroup$
– TheSilverDoe
Mar 20 at 20:10
$begingroup$
Right! I had deleted my comment because I was trying exactly that! great, thanks
$endgroup$
– Spasoje Durovic
Mar 20 at 20:11
$begingroup$
$f(3^100)=f(3.3^99)=f(2.3^99)+5 = f(3.(2.3^98))+5 = f(2.2.3^98) + 5+5 = f(2^2.3^98)+2times5 = ...$ and so on.
$endgroup$
– TheSilverDoe
Mar 20 at 20:10
$begingroup$
$f(3^100)=f(3.3^99)=f(2.3^99)+5 = f(3.(2.3^98))+5 = f(2.2.3^98) + 5+5 = f(2^2.3^98)+2times5 = ...$ and so on.
$endgroup$
– TheSilverDoe
Mar 20 at 20:10
$begingroup$
Right! I had deleted my comment because I was trying exactly that! great, thanks
$endgroup$
– Spasoje Durovic
Mar 20 at 20:11
$begingroup$
Right! I had deleted my comment because I was trying exactly that! great, thanks
$endgroup$
– Spasoje Durovic
Mar 20 at 20:11
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%2f3155934%2frecursion-computing-f3100%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$
Let me know if I made some silly mistake!
$endgroup$
– Spasoje Durovic
Mar 20 at 19:55