Representing positive integers as floor of integer powers of real number.












2














Does there exist real $a$ such that for every positive integer $c$ there exists integer $b$ such that $lfloor{a^b}rfloor = c$?










share|cite|improve this question




















  • 1




    You mean a single $a$ for all $b,c$?
    – gammatester
    Nov 27 '18 at 10:09










  • I've edited the question, sorry for my mistake. Yes, one $a$.
    – user4201961
    Nov 27 '18 at 10:11


















2














Does there exist real $a$ such that for every positive integer $c$ there exists integer $b$ such that $lfloor{a^b}rfloor = c$?










share|cite|improve this question




















  • 1




    You mean a single $a$ for all $b,c$?
    – gammatester
    Nov 27 '18 at 10:09










  • I've edited the question, sorry for my mistake. Yes, one $a$.
    – user4201961
    Nov 27 '18 at 10:11
















2












2








2


2





Does there exist real $a$ such that for every positive integer $c$ there exists integer $b$ such that $lfloor{a^b}rfloor = c$?










share|cite|improve this question















Does there exist real $a$ such that for every positive integer $c$ there exists integer $b$ such that $lfloor{a^b}rfloor = c$?







exponentiation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 27 '18 at 10:11

























asked Nov 27 '18 at 10:06









user4201961

629411




629411








  • 1




    You mean a single $a$ for all $b,c$?
    – gammatester
    Nov 27 '18 at 10:09










  • I've edited the question, sorry for my mistake. Yes, one $a$.
    – user4201961
    Nov 27 '18 at 10:11
















  • 1




    You mean a single $a$ for all $b,c$?
    – gammatester
    Nov 27 '18 at 10:09










  • I've edited the question, sorry for my mistake. Yes, one $a$.
    – user4201961
    Nov 27 '18 at 10:11










1




1




You mean a single $a$ for all $b,c$?
– gammatester
Nov 27 '18 at 10:09




You mean a single $a$ for all $b,c$?
– gammatester
Nov 27 '18 at 10:09












I've edited the question, sorry for my mistake. Yes, one $a$.
– user4201961
Nov 27 '18 at 10:11






I've edited the question, sorry for my mistake. Yes, one $a$.
– user4201961
Nov 27 '18 at 10:11












1 Answer
1






active

oldest

votes


















2














No.



The simplest way to see why the answer is no is the fact that, for $a>1$, you have



$$lim_{btoinfty} (a^b-a^{b-1}) = infty$$



(which you can see is true since $a^b-a^{b-1} = a^{b-1}(a-1)$)



The limit tells you that, for large enough values of $b$, you will have $a^b-a^{b-1}>2$ which means that there must be at least one integer $n$ between $lfloor a^{b-1}rfloor$ and $lfloor a^brfloor$ (that is, $lfloor a^{b-1}rfloor<n<lfloor a^brfloor$. Couple that with the fact that $lfloor a^brfloor$ is an increasing sequence, and you are done, because $$forall b: lfloor a^brfloorneq n$$






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%2f3015586%2frepresenting-positive-integers-as-floor-of-integer-powers-of-real-number%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









    2














    No.



    The simplest way to see why the answer is no is the fact that, for $a>1$, you have



    $$lim_{btoinfty} (a^b-a^{b-1}) = infty$$



    (which you can see is true since $a^b-a^{b-1} = a^{b-1}(a-1)$)



    The limit tells you that, for large enough values of $b$, you will have $a^b-a^{b-1}>2$ which means that there must be at least one integer $n$ between $lfloor a^{b-1}rfloor$ and $lfloor a^brfloor$ (that is, $lfloor a^{b-1}rfloor<n<lfloor a^brfloor$. Couple that with the fact that $lfloor a^brfloor$ is an increasing sequence, and you are done, because $$forall b: lfloor a^brfloorneq n$$






    share|cite|improve this answer


























      2














      No.



      The simplest way to see why the answer is no is the fact that, for $a>1$, you have



      $$lim_{btoinfty} (a^b-a^{b-1}) = infty$$



      (which you can see is true since $a^b-a^{b-1} = a^{b-1}(a-1)$)



      The limit tells you that, for large enough values of $b$, you will have $a^b-a^{b-1}>2$ which means that there must be at least one integer $n$ between $lfloor a^{b-1}rfloor$ and $lfloor a^brfloor$ (that is, $lfloor a^{b-1}rfloor<n<lfloor a^brfloor$. Couple that with the fact that $lfloor a^brfloor$ is an increasing sequence, and you are done, because $$forall b: lfloor a^brfloorneq n$$






      share|cite|improve this answer
























        2












        2








        2






        No.



        The simplest way to see why the answer is no is the fact that, for $a>1$, you have



        $$lim_{btoinfty} (a^b-a^{b-1}) = infty$$



        (which you can see is true since $a^b-a^{b-1} = a^{b-1}(a-1)$)



        The limit tells you that, for large enough values of $b$, you will have $a^b-a^{b-1}>2$ which means that there must be at least one integer $n$ between $lfloor a^{b-1}rfloor$ and $lfloor a^brfloor$ (that is, $lfloor a^{b-1}rfloor<n<lfloor a^brfloor$. Couple that with the fact that $lfloor a^brfloor$ is an increasing sequence, and you are done, because $$forall b: lfloor a^brfloorneq n$$






        share|cite|improve this answer












        No.



        The simplest way to see why the answer is no is the fact that, for $a>1$, you have



        $$lim_{btoinfty} (a^b-a^{b-1}) = infty$$



        (which you can see is true since $a^b-a^{b-1} = a^{b-1}(a-1)$)



        The limit tells you that, for large enough values of $b$, you will have $a^b-a^{b-1}>2$ which means that there must be at least one integer $n$ between $lfloor a^{b-1}rfloor$ and $lfloor a^brfloor$ (that is, $lfloor a^{b-1}rfloor<n<lfloor a^brfloor$. Couple that with the fact that $lfloor a^brfloor$ is an increasing sequence, and you are done, because $$forall b: lfloor a^brfloorneq n$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 27 '18 at 10:21









        5xum

        89.5k393161




        89.5k393161






























            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%2f3015586%2frepresenting-positive-integers-as-floor-of-integer-powers-of-real-number%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

            Quarter-circle Tiles

            build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

            Mont Emei