What is a minimal set of rules that determine the usual order on $Bbb{N}$ given that $1 lt p_1 lt p_2 lt...












4












$begingroup$


Let $p_i$ always mean the $i$th prime number.



Given two numbers $a, b in Bbb{N}$ in the form $a = {(p_i, e_i) : p_i^{e_i} mid a, e_i text{ maximal}}$ ie. essentially their unique factorization, what is a natural way to compute whether $a gt b$?



For instance a rule might be $p_{j}^2 gt p_{j+1}$ always. So that given $a = 2^2$, $b = 3$, we immediately have $a gt b$.



Is there a simple set of rules such that given the usual ordering on the primes and $1$: $1 lt p_1 lt p_2 lt dots$ we can always derive $a gt b$ when it is true?



By no means can we include converting the number to a base representation and comparing the last digit.



It's best to work by example sometimes. Take $2 cdot 7 lt 3cdot 5$. Well, $2 lt 3 lt 5 lt 7$ so... ?



I'm stuck on this one, what is the simplest rule you can think of to overcome this example?






elementary-number-theory prime-numbers order-theory natural-numbers







share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    It's certainly true that, given only the information $p_1<p_2<p_3<p_4$, there's no way to determine which of $p_1p_4$ and $p_2p_3$ is larger.
    $endgroup$
    – Greg Martin
    Dec 20 '18 at 5:31






  • 1




    $begingroup$
    Or how about comparing $2^{11}3^25^97$ with $p_{10 000 000 000}?$ I don't expect there to be a simple rule.
    $endgroup$
    – Ross Millikan
    Dec 20 '18 at 5:39


















4












$begingroup$


Let $p_i$ always mean the $i$th prime number.



Given two numbers $a, b in Bbb{N}$ in the form $a = {(p_i, e_i) : p_i^{e_i} mid a, e_i text{ maximal}}$ ie. essentially their unique factorization, what is a natural way to compute whether $a gt b$?



For instance a rule might be $p_{j}^2 gt p_{j+1}$ always. So that given $a = 2^2$, $b = 3$, we immediately have $a gt b$.



Is there a simple set of rules such that given the usual ordering on the primes and $1$: $1 lt p_1 lt p_2 lt dots$ we can always derive $a gt b$ when it is true?



By no means can we include converting the number to a base representation and comparing the last digit.



It's best to work by example sometimes. Take $2 cdot 7 lt 3cdot 5$. Well, $2 lt 3 lt 5 lt 7$ so... ?



I'm stuck on this one, what is the simplest rule you can think of to overcome this example?






elementary-number-theory prime-numbers order-theory natural-numbers







share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    It's certainly true that, given only the information $p_1<p_2<p_3<p_4$, there's no way to determine which of $p_1p_4$ and $p_2p_3$ is larger.
    $endgroup$
    – Greg Martin
    Dec 20 '18 at 5:31






  • 1




    $begingroup$
    Or how about comparing $2^{11}3^25^97$ with $p_{10 000 000 000}?$ I don't expect there to be a simple rule.
    $endgroup$
    – Ross Millikan
    Dec 20 '18 at 5:39
















4












4








4


1



$begingroup$


Let $p_i$ always mean the $i$th prime number.



Given two numbers $a, b in Bbb{N}$ in the form $a = {(p_i, e_i) : p_i^{e_i} mid a, e_i text{ maximal}}$ ie. essentially their unique factorization, what is a natural way to compute whether $a gt b$?



For instance a rule might be $p_{j}^2 gt p_{j+1}$ always. So that given $a = 2^2$, $b = 3$, we immediately have $a gt b$.



Is there a simple set of rules such that given the usual ordering on the primes and $1$: $1 lt p_1 lt p_2 lt dots$ we can always derive $a gt b$ when it is true?



By no means can we include converting the number to a base representation and comparing the last digit.



It's best to work by example sometimes. Take $2 cdot 7 lt 3cdot 5$. Well, $2 lt 3 lt 5 lt 7$ so... ?



I'm stuck on this one, what is the simplest rule you can think of to overcome this example?






elementary-number-theory prime-numbers order-theory natural-numbers







share|cite|improve this question











$endgroup$




Let $p_i$ always mean the $i$th prime number.



Given two numbers $a, b in Bbb{N}$ in the form $a = {(p_i, e_i) : p_i^{e_i} mid a, e_i text{ maximal}}$ ie. essentially their unique factorization, what is a natural way to compute whether $a gt b$?



For instance a rule might be $p_{j}^2 gt p_{j+1}$ always. So that given $a = 2^2$, $b = 3$, we immediately have $a gt b$.



Is there a simple set of rules such that given the usual ordering on the primes and $1$: $1 lt p_1 lt p_2 lt dots$ we can always derive $a gt b$ when it is true?



By no means can we include converting the number to a base representation and comparing the last digit.



It's best to work by example sometimes. Take $2 cdot 7 lt 3cdot 5$. Well, $2 lt 3 lt 5 lt 7$ so... ?



I'm stuck on this one, what is the simplest rule you can think of to overcome this example?






elementary-number-theory prime-numbers order-theory natural-numbers




elementary-number-theory prime-numbers order-theory natural-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 20 '18 at 5:01







BananaCats

















asked Dec 20 '18 at 4:55









BananaCatsBananaCats

9,35052659




9,35052659








  • 2




    $begingroup$
    It's certainly true that, given only the information $p_1<p_2<p_3<p_4$, there's no way to determine which of $p_1p_4$ and $p_2p_3$ is larger.
    $endgroup$
    – Greg Martin
    Dec 20 '18 at 5:31






  • 1




    $begingroup$
    Or how about comparing $2^{11}3^25^97$ with $p_{10 000 000 000}?$ I don't expect there to be a simple rule.
    $endgroup$
    – Ross Millikan
    Dec 20 '18 at 5:39
















  • 2




    $begingroup$
    It's certainly true that, given only the information $p_1<p_2<p_3<p_4$, there's no way to determine which of $p_1p_4$ and $p_2p_3$ is larger.
    $endgroup$
    – Greg Martin
    Dec 20 '18 at 5:31






  • 1




    $begingroup$
    Or how about comparing $2^{11}3^25^97$ with $p_{10 000 000 000}?$ I don't expect there to be a simple rule.
    $endgroup$
    – Ross Millikan
    Dec 20 '18 at 5:39










2




2




$begingroup$
It's certainly true that, given only the information $p_1<p_2<p_3<p_4$, there's no way to determine which of $p_1p_4$ and $p_2p_3$ is larger.
$endgroup$
– Greg Martin
Dec 20 '18 at 5:31




$begingroup$
It's certainly true that, given only the information $p_1<p_2<p_3<p_4$, there's no way to determine which of $p_1p_4$ and $p_2p_3$ is larger.
$endgroup$
– Greg Martin
Dec 20 '18 at 5:31




1




1




$begingroup$
Or how about comparing $2^{11}3^25^97$ with $p_{10 000 000 000}?$ I don't expect there to be a simple rule.
$endgroup$
– Ross Millikan
Dec 20 '18 at 5:39






$begingroup$
Or how about comparing $2^{11}3^25^97$ with $p_{10 000 000 000}?$ I don't expect there to be a simple rule.
$endgroup$
– Ross Millikan
Dec 20 '18 at 5:39












1 Answer
1






active

oldest

votes


















2












$begingroup$

Here's some evidence that this may be hard.



In mathematical logic class we learn that the theory of $(mathbb N,times)$ is decidable. Basically, because the fundamental theorem of arithmetic states that the monoid of positive integers under multiplication $times$ is a free commutative monoid on an infinite set of generators, the prime numbers.



But if we add in the relation $x< y$, you get the same definable sets as in all of first-order arithmetic $(mathbb N,+,times)$, which is not decidable. This is described by Alexis Bès.






share|cite|improve this answer









$endgroup$














    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%2f3047172%2fwhat-is-a-minimal-set-of-rules-that-determine-the-usual-order-on-bbbn-given%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












    $begingroup$

    Here's some evidence that this may be hard.



    In mathematical logic class we learn that the theory of $(mathbb N,times)$ is decidable. Basically, because the fundamental theorem of arithmetic states that the monoid of positive integers under multiplication $times$ is a free commutative monoid on an infinite set of generators, the prime numbers.



    But if we add in the relation $x< y$, you get the same definable sets as in all of first-order arithmetic $(mathbb N,+,times)$, which is not decidable. This is described by Alexis Bès.






    share|cite|improve this answer









    $endgroup$


















      2












      $begingroup$

      Here's some evidence that this may be hard.



      In mathematical logic class we learn that the theory of $(mathbb N,times)$ is decidable. Basically, because the fundamental theorem of arithmetic states that the monoid of positive integers under multiplication $times$ is a free commutative monoid on an infinite set of generators, the prime numbers.



      But if we add in the relation $x< y$, you get the same definable sets as in all of first-order arithmetic $(mathbb N,+,times)$, which is not decidable. This is described by Alexis Bès.






      share|cite|improve this answer









      $endgroup$
















        2












        2








        2





        $begingroup$

        Here's some evidence that this may be hard.



        In mathematical logic class we learn that the theory of $(mathbb N,times)$ is decidable. Basically, because the fundamental theorem of arithmetic states that the monoid of positive integers under multiplication $times$ is a free commutative monoid on an infinite set of generators, the prime numbers.



        But if we add in the relation $x< y$, you get the same definable sets as in all of first-order arithmetic $(mathbb N,+,times)$, which is not decidable. This is described by Alexis Bès.






        share|cite|improve this answer









        $endgroup$



        Here's some evidence that this may be hard.



        In mathematical logic class we learn that the theory of $(mathbb N,times)$ is decidable. Basically, because the fundamental theorem of arithmetic states that the monoid of positive integers under multiplication $times$ is a free commutative monoid on an infinite set of generators, the prime numbers.



        But if we add in the relation $x< y$, you get the same definable sets as in all of first-order arithmetic $(mathbb N,+,times)$, which is not decidable. This is described by Alexis Bès.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 20 '18 at 5:40









        Bjørn Kjos-HanssenBjørn Kjos-Hanssen

        2,107918




        2,107918






























            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3047172%2fwhat-is-a-minimal-set-of-rules-that-determine-the-usual-order-on-bbbn-given%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

            Plaza Victoria

            Image
            Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l
            Read more

            In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

            Image
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 2 OneNote has two useful keyboard shortcuts for bulleted and numbered lists, namely Ctrl + . and Ctrl + - . Is there something similar for PowerPoint where the work with lists is also very common? Haven't found anything here: Use keyboard shortcuts in PowerPoint. keyboard-shortcuts microsoft-powerpoint share | improve this question edited Aug 14 '14 at 14:49 Linger 2,826 10 28 40
            Read more

            How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...

            Image
            1 0 I want to put 3 images in LateX such as 2 figures are side by side horizotally and 3rd figure below these 2 side by side figures but in middle. I have following code: begin{figure}[H] centering begin{minipage}{.5textwidth} centering includegraphics[width=.50linewidth]{Text/Images/Genelec_8010_AP.jpg} captionof{figure}{Genelec 8010 AP} label{fig:Genelec 8010} end{minipage}% begin{minipage}{.5textwidth} centering includegraphics[width=.69linewidth]{Text/Images/Genelec_8020_CPM.jpg} captionof{figure}{Genelec 8020 CPM} label{fig:Genelec 8020} end{minipage}% end{figure} %%Here is my 3rd picture code begin{figure} centering includegraphics[width=5cm]{Text/Images/Genelec_8030_BPM.jpg} caption{Genelec 8030 BPM} label{fig:Genelec 8030} end{figure} I want to ask ho
            Read more