Prove that there does not exist a strictly increasing function satisfying $f(2)=3$ and $f(acdot b)=f(a)cdot...












3














I stumbled upon the following problem, but I can't seem to find a way to prove it.




Show that there does not exist a strictly increasing function that maps the set of natural numbers to natural numbers, satisfying $f(2)=3$ and $f(acdot b)=f(a)cdot f(b)$ for any $a,b$ in the naturals.




The only information I was able to obtain from the probably are trivialities, such as $f(2)=3,f(1)=1,f(4)=9, 9<f(5)<27, f(6)=3f(3),$ if it is assumed that the function is actually increasing. Altough, I can't find a pattern nor disprove by contraddiction. How would I go about this?










share|cite|improve this question






















  • Probably a noteworthy clarification: do the naturals in this context include $0$ or no? Depending on the context or professor/author, people seem to differ on whether $0 in mathbb{N}$. If it is allowed, then it makes finding such a counterexample fairly easy, I think, but best to ask first.
    – Eevee Trainer
    Nov 20 '18 at 0:18
















3














I stumbled upon the following problem, but I can't seem to find a way to prove it.




Show that there does not exist a strictly increasing function that maps the set of natural numbers to natural numbers, satisfying $f(2)=3$ and $f(acdot b)=f(a)cdot f(b)$ for any $a,b$ in the naturals.




The only information I was able to obtain from the probably are trivialities, such as $f(2)=3,f(1)=1,f(4)=9, 9<f(5)<27, f(6)=3f(3),$ if it is assumed that the function is actually increasing. Altough, I can't find a pattern nor disprove by contraddiction. How would I go about this?










share|cite|improve this question






















  • Probably a noteworthy clarification: do the naturals in this context include $0$ or no? Depending on the context or professor/author, people seem to differ on whether $0 in mathbb{N}$. If it is allowed, then it makes finding such a counterexample fairly easy, I think, but best to ask first.
    – Eevee Trainer
    Nov 20 '18 at 0:18














3












3








3







I stumbled upon the following problem, but I can't seem to find a way to prove it.




Show that there does not exist a strictly increasing function that maps the set of natural numbers to natural numbers, satisfying $f(2)=3$ and $f(acdot b)=f(a)cdot f(b)$ for any $a,b$ in the naturals.




The only information I was able to obtain from the probably are trivialities, such as $f(2)=3,f(1)=1,f(4)=9, 9<f(5)<27, f(6)=3f(3),$ if it is assumed that the function is actually increasing. Altough, I can't find a pattern nor disprove by contraddiction. How would I go about this?










share|cite|improve this question













I stumbled upon the following problem, but I can't seem to find a way to prove it.




Show that there does not exist a strictly increasing function that maps the set of natural numbers to natural numbers, satisfying $f(2)=3$ and $f(acdot b)=f(a)cdot f(b)$ for any $a,b$ in the naturals.




The only information I was able to obtain from the probably are trivialities, such as $f(2)=3,f(1)=1,f(4)=9, 9<f(5)<27, f(6)=3f(3),$ if it is assumed that the function is actually increasing. Altough, I can't find a pattern nor disprove by contraddiction. How would I go about this?







real-analysis






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 20 '18 at 0:05









DMH16

578217




578217












  • Probably a noteworthy clarification: do the naturals in this context include $0$ or no? Depending on the context or professor/author, people seem to differ on whether $0 in mathbb{N}$. If it is allowed, then it makes finding such a counterexample fairly easy, I think, but best to ask first.
    – Eevee Trainer
    Nov 20 '18 at 0:18


















  • Probably a noteworthy clarification: do the naturals in this context include $0$ or no? Depending on the context or professor/author, people seem to differ on whether $0 in mathbb{N}$. If it is allowed, then it makes finding such a counterexample fairly easy, I think, but best to ask first.
    – Eevee Trainer
    Nov 20 '18 at 0:18
















Probably a noteworthy clarification: do the naturals in this context include $0$ or no? Depending on the context or professor/author, people seem to differ on whether $0 in mathbb{N}$. If it is allowed, then it makes finding such a counterexample fairly easy, I think, but best to ask first.
– Eevee Trainer
Nov 20 '18 at 0:18




Probably a noteworthy clarification: do the naturals in this context include $0$ or no? Depending on the context or professor/author, people seem to differ on whether $0 in mathbb{N}$. If it is allowed, then it makes finding such a counterexample fairly easy, I think, but best to ask first.
– Eevee Trainer
Nov 20 '18 at 0:18










1 Answer
1






active

oldest

votes


















3














Hint: Let $f(3)=k$. Then



$$f(2^m)=3^m$$



and



$$f(3^n)=k^n.$$



Can you find a pair $(m,n)$ so $2^m<3^n$ but $3^m>k^n$ or vice versa?






share|cite|improve this answer





















    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%2f3005725%2fprove-that-there-does-not-exist-a-strictly-increasing-function-satisfying-f2%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









    3














    Hint: Let $f(3)=k$. Then



    $$f(2^m)=3^m$$



    and



    $$f(3^n)=k^n.$$



    Can you find a pair $(m,n)$ so $2^m<3^n$ but $3^m>k^n$ or vice versa?






    share|cite|improve this answer


























      3














      Hint: Let $f(3)=k$. Then



      $$f(2^m)=3^m$$



      and



      $$f(3^n)=k^n.$$



      Can you find a pair $(m,n)$ so $2^m<3^n$ but $3^m>k^n$ or vice versa?






      share|cite|improve this answer
























        3












        3








        3






        Hint: Let $f(3)=k$. Then



        $$f(2^m)=3^m$$



        and



        $$f(3^n)=k^n.$$



        Can you find a pair $(m,n)$ so $2^m<3^n$ but $3^m>k^n$ or vice versa?






        share|cite|improve this answer












        Hint: Let $f(3)=k$. Then



        $$f(2^m)=3^m$$



        and



        $$f(3^n)=k^n.$$



        Can you find a pair $(m,n)$ so $2^m<3^n$ but $3^m>k^n$ or vice versa?







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 20 '18 at 0:21









        Carl Schildkraut

        11.2k11441




        11.2k11441






























            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.





            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005725%2fprove-that-there-does-not-exist-a-strictly-increasing-function-satisfying-f2%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

            Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

            Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

            A Topological Invariant for $pi_3(U(n))$