Primality test calulating on paper. Specific case

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












How to make primality test on paper without any calculator for high numbers like
$$
(32^200) - 1
$$



$$
(400^555) - 1
$$
What specific test is useful in such cases: $$(a^b) - 1$$ where a and b are high numbers), Fermat's theorem, AKS or is there any other test that shows that this equation is prime number?







share|cite|improve this question





















  • As long as $a>2$ or $b$ is composite, one can just write down a factor of $a^b-1$.
    – Lord Shark the Unknown
    Jul 16 at 17:44










  • ...but even if $a>2$ and $b$ is prime, $a^b - 1$ can be composite.
    – David G. Stork
    Jul 16 at 18:55














up vote
0
down vote

favorite












How to make primality test on paper without any calculator for high numbers like
$$
(32^200) - 1
$$



$$
(400^555) - 1
$$
What specific test is useful in such cases: $$(a^b) - 1$$ where a and b are high numbers), Fermat's theorem, AKS or is there any other test that shows that this equation is prime number?







share|cite|improve this question





















  • As long as $a>2$ or $b$ is composite, one can just write down a factor of $a^b-1$.
    – Lord Shark the Unknown
    Jul 16 at 17:44










  • ...but even if $a>2$ and $b$ is prime, $a^b - 1$ can be composite.
    – David G. Stork
    Jul 16 at 18:55












up vote
0
down vote

favorite









up vote
0
down vote

favorite











How to make primality test on paper without any calculator for high numbers like
$$
(32^200) - 1
$$



$$
(400^555) - 1
$$
What specific test is useful in such cases: $$(a^b) - 1$$ where a and b are high numbers), Fermat's theorem, AKS or is there any other test that shows that this equation is prime number?







share|cite|improve this question













How to make primality test on paper without any calculator for high numbers like
$$
(32^200) - 1
$$



$$
(400^555) - 1
$$
What specific test is useful in such cases: $$(a^b) - 1$$ where a and b are high numbers), Fermat's theorem, AKS or is there any other test that shows that this equation is prime number?









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Jul 16 at 17:51
























asked Jul 16 at 17:36









Some1

63




63











  • As long as $a>2$ or $b$ is composite, one can just write down a factor of $a^b-1$.
    – Lord Shark the Unknown
    Jul 16 at 17:44










  • ...but even if $a>2$ and $b$ is prime, $a^b - 1$ can be composite.
    – David G. Stork
    Jul 16 at 18:55
















  • As long as $a>2$ or $b$ is composite, one can just write down a factor of $a^b-1$.
    – Lord Shark the Unknown
    Jul 16 at 17:44










  • ...but even if $a>2$ and $b$ is prime, $a^b - 1$ can be composite.
    – David G. Stork
    Jul 16 at 18:55















As long as $a>2$ or $b$ is composite, one can just write down a factor of $a^b-1$.
– Lord Shark the Unknown
Jul 16 at 17:44




As long as $a>2$ or $b$ is composite, one can just write down a factor of $a^b-1$.
– Lord Shark the Unknown
Jul 16 at 17:44












...but even if $a>2$ and $b$ is prime, $a^b - 1$ can be composite.
– David G. Stork
Jul 16 at 18:55




...but even if $a>2$ and $b$ is prime, $a^b - 1$ can be composite.
– David G. Stork
Jul 16 at 18:55










1 Answer
1






active

oldest

votes

















up vote
3
down vote



accepted










$a-1$ is a factor of $a^b-1$. So if $a>2$, then $a^b-1$ is composite. For the case of $a=2$, you are looking for Mersenne primes.






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',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2853649%2fprimality-test-calulating-on-paper-specific-case%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    3
    down vote



    accepted










    $a-1$ is a factor of $a^b-1$. So if $a>2$, then $a^b-1$ is composite. For the case of $a=2$, you are looking for Mersenne primes.






    share|cite|improve this answer

























      up vote
      3
      down vote



      accepted










      $a-1$ is a factor of $a^b-1$. So if $a>2$, then $a^b-1$ is composite. For the case of $a=2$, you are looking for Mersenne primes.






      share|cite|improve this answer























        up vote
        3
        down vote



        accepted







        up vote
        3
        down vote



        accepted






        $a-1$ is a factor of $a^b-1$. So if $a>2$, then $a^b-1$ is composite. For the case of $a=2$, you are looking for Mersenne primes.






        share|cite|improve this answer













        $a-1$ is a factor of $a^b-1$. So if $a>2$, then $a^b-1$ is composite. For the case of $a=2$, you are looking for Mersenne primes.







        share|cite|improve this answer













        share|cite|improve this answer



        share|cite|improve this answer











        answered Jul 16 at 17:42









        paw88789

        28.2k12248




        28.2k12248






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2853649%2fprimality-test-calulating-on-paper-specific-case%23new-answer', 'question_page');

            );

            Post as a guest













































































            Comments

            Popular posts from this blog

            What is the equation of a 3D cone with generalised tilt?

            Color the edges and diagonals of a regular polygon

            Relationship between determinant of matrix and determinant of adjoint?