Doubt about $n$ queens problem when $gcd(n,6)=pm 1$ Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)two questions about Diophantine EquationMinimum queens to reach $8 times 8$ squares as a graph problemmaximum nonattacking black and white queens on infinite chessboardHow would someone go about proving the Frobenius Coin Problem (for m = 3)???Greatest number of non-attacking moves that queens can make on an $n times n$ chess board.the 8 queens conjecture: the next level (or dimension)Show that only finitely many positive integers $n$ have the property that for all $m$ for which $1<m<n$ and $textgcd(m,n) = 1$, $m$ is prime.Reference on properties of the queen graph $Q_n$?find $G=gcd(a^m+1,a^n+1)$ from a problemextending 8 queen chess puzzle to n*n chessboard

Why is Nikon 1.4g better when Nikon 1.8g is sharper?

What initially awakened the Balrog?

Maximum summed subsequences with non-adjacent items

Using et al. for a last / senior author rather than for a first author

Do any jurisdictions seriously consider reclassifying social media websites as publishers?

Effects on objects due to a brief relocation of massive amounts of mass

What was the first language to use conditional keywords?

Find 108 by using 3,4,6

How to write the following sign?

How to install press fit bottom bracket into new frame

SF book about people trapped in a series of worlds they imagine

What is the topology associated with the algebras for the ultrafilter monad?

How to tell that you are a giant?

Why is it faster to reheat something than it is to cook it?

Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?

Is a ledger board required if the side of my house is wood?

Time to Settle Down!

How fail-safe is nr as stop bytes?

Is grep documentation about ignoring case wrong, since it doesn't ignore case in filenames?

What is this clumpy 20-30cm high yellow-flowered plant?

What is the appropriate index architecture when forced to implement IsDeleted (soft deletes)?

How does the math work when buying airline miles?

Trademark violation for app?

The code below, is it ill-formed NDR or is it well formed?



Doubt about $n$ queens problem when $gcd(n,6)=pm 1$



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)two questions about Diophantine EquationMinimum queens to reach $8 times 8$ squares as a graph problemmaximum nonattacking black and white queens on infinite chessboardHow would someone go about proving the Frobenius Coin Problem (for m = 3)???Greatest number of non-attacking moves that queens can make on an $n times n$ chess board.the 8 queens conjecture: the next level (or dimension)Show that only finitely many positive integers $n$ have the property that for all $m$ for which $1<m<n$ and $textgcd(m,n) = 1$, $m$ is prime.Reference on properties of the queen graph $Q_n$?find $G=gcd(a^m+1,a^n+1)$ from a problemextending 8 queen chess puzzle to n*n chessboard










0












$begingroup$


So I know that the $n$-queens problem only has modular solutions if $gcd(n,6) = pm 1$



My doubt is: if $gcd(n,6) = pm 1$ then are all solutions modular? Or can there be normal solutions which are not preserved by translation?










share|cite|improve this question









$endgroup$







  • 2




    $begingroup$
    Please explain what you mean by a modular solution.
    $endgroup$
    – saulspatz
    Apr 1 at 18:42










  • $begingroup$
    I mean solutions which remain solution after a (modular) translation of the board is applied (say, every queen shifts i to the right and j down, identifying the 1st row as the one that comes next the last and likewise for column) A modular solution has the property that even after a shift like that it remains a solution
    $endgroup$
    – karlabos
    Apr 1 at 18:46










  • $begingroup$
    How can a gcd be negative?
    $endgroup$
    – Servaes
    Apr 1 at 21:29















0












$begingroup$


So I know that the $n$-queens problem only has modular solutions if $gcd(n,6) = pm 1$



My doubt is: if $gcd(n,6) = pm 1$ then are all solutions modular? Or can there be normal solutions which are not preserved by translation?










share|cite|improve this question









$endgroup$







  • 2




    $begingroup$
    Please explain what you mean by a modular solution.
    $endgroup$
    – saulspatz
    Apr 1 at 18:42










  • $begingroup$
    I mean solutions which remain solution after a (modular) translation of the board is applied (say, every queen shifts i to the right and j down, identifying the 1st row as the one that comes next the last and likewise for column) A modular solution has the property that even after a shift like that it remains a solution
    $endgroup$
    – karlabos
    Apr 1 at 18:46










  • $begingroup$
    How can a gcd be negative?
    $endgroup$
    – Servaes
    Apr 1 at 21:29













0












0








0





$begingroup$


So I know that the $n$-queens problem only has modular solutions if $gcd(n,6) = pm 1$



My doubt is: if $gcd(n,6) = pm 1$ then are all solutions modular? Or can there be normal solutions which are not preserved by translation?










share|cite|improve this question









$endgroup$




So I know that the $n$-queens problem only has modular solutions if $gcd(n,6) = pm 1$



My doubt is: if $gcd(n,6) = pm 1$ then are all solutions modular? Or can there be normal solutions which are not preserved by translation?







number-theory graph-theory chessboard






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Apr 1 at 18:37









karlaboskarlabos

406414




406414







  • 2




    $begingroup$
    Please explain what you mean by a modular solution.
    $endgroup$
    – saulspatz
    Apr 1 at 18:42










  • $begingroup$
    I mean solutions which remain solution after a (modular) translation of the board is applied (say, every queen shifts i to the right and j down, identifying the 1st row as the one that comes next the last and likewise for column) A modular solution has the property that even after a shift like that it remains a solution
    $endgroup$
    – karlabos
    Apr 1 at 18:46










  • $begingroup$
    How can a gcd be negative?
    $endgroup$
    – Servaes
    Apr 1 at 21:29












  • 2




    $begingroup$
    Please explain what you mean by a modular solution.
    $endgroup$
    – saulspatz
    Apr 1 at 18:42










  • $begingroup$
    I mean solutions which remain solution after a (modular) translation of the board is applied (say, every queen shifts i to the right and j down, identifying the 1st row as the one that comes next the last and likewise for column) A modular solution has the property that even after a shift like that it remains a solution
    $endgroup$
    – karlabos
    Apr 1 at 18:46










  • $begingroup$
    How can a gcd be negative?
    $endgroup$
    – Servaes
    Apr 1 at 21:29







2




2




$begingroup$
Please explain what you mean by a modular solution.
$endgroup$
– saulspatz
Apr 1 at 18:42




$begingroup$
Please explain what you mean by a modular solution.
$endgroup$
– saulspatz
Apr 1 at 18:42












$begingroup$
I mean solutions which remain solution after a (modular) translation of the board is applied (say, every queen shifts i to the right and j down, identifying the 1st row as the one that comes next the last and likewise for column) A modular solution has the property that even after a shift like that it remains a solution
$endgroup$
– karlabos
Apr 1 at 18:46




$begingroup$
I mean solutions which remain solution after a (modular) translation of the board is applied (say, every queen shifts i to the right and j down, identifying the 1st row as the one that comes next the last and likewise for column) A modular solution has the property that even after a shift like that it remains a solution
$endgroup$
– karlabos
Apr 1 at 18:46












$begingroup$
How can a gcd be negative?
$endgroup$
– Servaes
Apr 1 at 21:29




$begingroup$
How can a gcd be negative?
$endgroup$
– Servaes
Apr 1 at 21:29










1 Answer
1






active

oldest

votes


















2












$begingroup$

It seems that all $5$ queens solutions are modular, but here is a $7$ queens solution which is not:
$$
beginarrayc
hline
&Qrule[-0.6ex]0ex3ex\
hline
&&&Qrule[-0.6ex]0ex3ex\
hline
Qrule[-0.6ex]0ex3ex\
hline
&&&&&&Qrule[-0.6ex]0ex3ex\
hline
&&&&Qrule[-0.6ex]0ex3ex\
hline
&&Qrule[-0.6ex]0ex3ex\
hline
&&&&&Qrule[-0.6ex]0ex3ex\
hline
endarray
$$

Rotating this board to the left or right will cause a conflict between the queens on the third and fourth rows.






share|cite|improve this answer









$endgroup$













    Your Answer








    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%2f3170982%2fdoubt-about-n-queens-problem-when-gcdn-6-pm-1%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$

    It seems that all $5$ queens solutions are modular, but here is a $7$ queens solution which is not:
    $$
    beginarrayc
    hline
    &Qrule[-0.6ex]0ex3ex\
    hline
    &&&Qrule[-0.6ex]0ex3ex\
    hline
    Qrule[-0.6ex]0ex3ex\
    hline
    &&&&&&Qrule[-0.6ex]0ex3ex\
    hline
    &&&&Qrule[-0.6ex]0ex3ex\
    hline
    &&Qrule[-0.6ex]0ex3ex\
    hline
    &&&&&Qrule[-0.6ex]0ex3ex\
    hline
    endarray
    $$

    Rotating this board to the left or right will cause a conflict between the queens on the third and fourth rows.






    share|cite|improve this answer









    $endgroup$

















      2












      $begingroup$

      It seems that all $5$ queens solutions are modular, but here is a $7$ queens solution which is not:
      $$
      beginarrayc
      hline
      &Qrule[-0.6ex]0ex3ex\
      hline
      &&&Qrule[-0.6ex]0ex3ex\
      hline
      Qrule[-0.6ex]0ex3ex\
      hline
      &&&&&&Qrule[-0.6ex]0ex3ex\
      hline
      &&&&Qrule[-0.6ex]0ex3ex\
      hline
      &&Qrule[-0.6ex]0ex3ex\
      hline
      &&&&&Qrule[-0.6ex]0ex3ex\
      hline
      endarray
      $$

      Rotating this board to the left or right will cause a conflict between the queens on the third and fourth rows.






      share|cite|improve this answer









      $endgroup$















        2












        2








        2





        $begingroup$

        It seems that all $5$ queens solutions are modular, but here is a $7$ queens solution which is not:
        $$
        beginarrayc
        hline
        &Qrule[-0.6ex]0ex3ex\
        hline
        &&&Qrule[-0.6ex]0ex3ex\
        hline
        Qrule[-0.6ex]0ex3ex\
        hline
        &&&&&&Qrule[-0.6ex]0ex3ex\
        hline
        &&&&Qrule[-0.6ex]0ex3ex\
        hline
        &&Qrule[-0.6ex]0ex3ex\
        hline
        &&&&&Qrule[-0.6ex]0ex3ex\
        hline
        endarray
        $$

        Rotating this board to the left or right will cause a conflict between the queens on the third and fourth rows.






        share|cite|improve this answer









        $endgroup$



        It seems that all $5$ queens solutions are modular, but here is a $7$ queens solution which is not:
        $$
        beginarrayc
        hline
        &Qrule[-0.6ex]0ex3ex\
        hline
        &&&Qrule[-0.6ex]0ex3ex\
        hline
        Qrule[-0.6ex]0ex3ex\
        hline
        &&&&&&Qrule[-0.6ex]0ex3ex\
        hline
        &&&&Qrule[-0.6ex]0ex3ex\
        hline
        &&Qrule[-0.6ex]0ex3ex\
        hline
        &&&&&Qrule[-0.6ex]0ex3ex\
        hline
        endarray
        $$

        Rotating this board to the left or right will cause a conflict between the queens on the third and fourth rows.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Apr 1 at 21:38









        FredHFredH

        3,6851024




        3,6851024



























            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%2f3170982%2fdoubt-about-n-queens-problem-when-gcdn-6-pm-1%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

            Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

            Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

            Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ