No won won? Wone Won












10












$begingroup$


Find four different digits $ W, O, N, E $
that satisfies the equation



$$ overline{NO} times overline{WON} times overline{WON} = overline{WONEWON} $$










share|improve this question











$endgroup$








  • 1




    $begingroup$
    What's up with the dashes above the letters? Are we negating anything, or how should I interpret those?
    $endgroup$
    – Mast
    May 4 at 19:11










  • $begingroup$
    I have given some of earlier puzzles as straight combination...as NO..normally concatenation..somebody interpreted as multiplication..one of the editors modified to the current format..each letter stands for a digit..bar above signifies..it is one number
    $endgroup$
    – Uvc
    May 4 at 19:45
















10












$begingroup$


Find four different digits $ W, O, N, E $
that satisfies the equation



$$ overline{NO} times overline{WON} times overline{WON} = overline{WONEWON} $$










share|improve this question











$endgroup$








  • 1




    $begingroup$
    What's up with the dashes above the letters? Are we negating anything, or how should I interpret those?
    $endgroup$
    – Mast
    May 4 at 19:11










  • $begingroup$
    I have given some of earlier puzzles as straight combination...as NO..normally concatenation..somebody interpreted as multiplication..one of the editors modified to the current format..each letter stands for a digit..bar above signifies..it is one number
    $endgroup$
    – Uvc
    May 4 at 19:45














10












10








10


3



$begingroup$


Find four different digits $ W, O, N, E $
that satisfies the equation



$$ overline{NO} times overline{WON} times overline{WON} = overline{WONEWON} $$










share|improve this question











$endgroup$




Find four different digits $ W, O, N, E $
that satisfies the equation



$$ overline{NO} times overline{WON} times overline{WON} = overline{WONEWON} $$







alphametic






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited May 9 at 18:11









PiIsNot3

4,5481154




4,5481154










asked May 4 at 3:19









UvcUvc

1,126119




1,126119








  • 1




    $begingroup$
    What's up with the dashes above the letters? Are we negating anything, or how should I interpret those?
    $endgroup$
    – Mast
    May 4 at 19:11










  • $begingroup$
    I have given some of earlier puzzles as straight combination...as NO..normally concatenation..somebody interpreted as multiplication..one of the editors modified to the current format..each letter stands for a digit..bar above signifies..it is one number
    $endgroup$
    – Uvc
    May 4 at 19:45














  • 1




    $begingroup$
    What's up with the dashes above the letters? Are we negating anything, or how should I interpret those?
    $endgroup$
    – Mast
    May 4 at 19:11










  • $begingroup$
    I have given some of earlier puzzles as straight combination...as NO..normally concatenation..somebody interpreted as multiplication..one of the editors modified to the current format..each letter stands for a digit..bar above signifies..it is one number
    $endgroup$
    – Uvc
    May 4 at 19:45








1




1




$begingroup$
What's up with the dashes above the letters? Are we negating anything, or how should I interpret those?
$endgroup$
– Mast
May 4 at 19:11




$begingroup$
What's up with the dashes above the letters? Are we negating anything, or how should I interpret those?
$endgroup$
– Mast
May 4 at 19:11












$begingroup$
I have given some of earlier puzzles as straight combination...as NO..normally concatenation..somebody interpreted as multiplication..one of the editors modified to the current format..each letter stands for a digit..bar above signifies..it is one number
$endgroup$
– Uvc
May 4 at 19:45




$begingroup$
I have given some of earlier puzzles as straight combination...as NO..normally concatenation..somebody interpreted as multiplication..one of the editors modified to the current format..each letter stands for a digit..bar above signifies..it is one number
$endgroup$
– Uvc
May 4 at 19:45










3 Answers
3






active

oldest

votes


















11












$begingroup$

The answer is




W = 1, O = 3, E = 0, N = 7

$73 * 137 * 137 = 1370137$




Method:




Divide both sides by $WON$

$NO * WON = 10001 + (E000 / WON)$

$ 0 <= E <= 9$


First consider cases when $E$ is not $0$ and

$(E000 / WON) = X $

$E000 = E * 2^3 * 5^3$

$N$ cannot be $0$ because $NO$ starts from it. So $WON$ cannot have both $2$s and $5$s as factors. If $WON$ does not have $5$s as factors it can be at most $9*2^3=72$ - not a three digit number. So $WON$ is an odd number divisible by $5$.


Now $X$ is obviously not divisible by $5$ because

$NO * WON = 10001 + X$


So $WON$ has to be divisible by $125$. That makes $X <=72$. Which contradicts $10001 + X$ being divisible by 125. So we proved that

$E = 0$ and

$NO * WON = 10001$


To get the last digit $1$ in the product with $N$ and $O$ being different digits we must have $NO = 37$ or $NO = 73$. $37$ is not a multiple of $10001$, so $NO = 73, WON = 137$







share|improve this answer











$endgroup$





















    3












    $begingroup$


    W=1, O=3, N=7, E=0




    works because




    73 * 137 * 137 = 1370137.




    Also,




    W=O=N=E=0




    works, but I don't think that's what you meant.






    share|improve this answer









    $endgroup$









    • 1




      $begingroup$
      Welcome to Puzzling! (Take the Tour!) Regarding your "Also", the puzzle does say "four different digits" (emphasis added). :)
      $endgroup$
      – Rubio
      May 4 at 5:44










    • $begingroup$
      Thanks! And oops. :/
      $endgroup$
      – LarrySnyder610
      May 4 at 10:56



















    1












    $begingroup$

    As this is not tagged "no-computers", I just used some Python :




    Solution : {'W': 1, 'O': 3, 'N': 7, 'E': 0}




    Method (Python) :





        def digit_sequence(string, digits): # string is sequence, digits are dictionairy with wone
    result=0
    for i in range(0, len(string)):
    result+=digits[string[i]]*(10**(len(string)-i-1))
    return result
    for W in range(0, 10):
    for O in range(0, 10):
    if W == O:
    continue
    for N in range(0, 10):
    if N == W or N == O:
    continue
    for E in range(0, 10):
    if E == W or E == O or E == N:
    continue
    # Four different digits W, O, N, E
    # Now check whether equation is fulfilled
    digits={"W": W, "O": O, "N": N, "E": E}
    if digit_sequence("NO", digits)*(digit_sequence("WON", digits)**2) == digit_sequence("WONEWON", digits):
    print("Solution : "+str(digits))





    share|improve this answer











    $endgroup$









    • 1




      $begingroup$
      I thought it might be fun to put together a solution that does this with an SMT solver, too. I used cryptol as my front-end, and I think it turned out pretty beautiful. Here it is in a gist just six lines long; an excerpt of interest is isSolution w o n e = all isDigit [w,o,n,e] / no*won*won == wonewon / no != 0.
      $endgroup$
      – Daniel Wagner
      May 4 at 17:29












    • $begingroup$
      You could add this as answer, too, @DanielWagner
      $endgroup$
      – LMD
      May 4 at 19:56












    • $begingroup$
      (This isn't PPCG though. Different mechanical means of arriving at the same result don't really provide any new information here. If you want to elaborate on an innovative method as your answer that's one thing; but just providing code that brute-forces the solution, or uses language or library functionality that keeps the actual mechanism mostly in a black box, is little better than stating 'the answer is X because magic'—it provides the same answer someone else already has, and does nothing to explain how to reach it. A comment is fine... an additional code answer probably isn't.)
      $endgroup$
      – Rubio
      May 4 at 23:40












    Your Answer








    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "559"
    };
    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: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    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%2fpuzzling.stackexchange.com%2fquestions%2f83601%2fno-won-won-wone-won%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    11












    $begingroup$

    The answer is




    W = 1, O = 3, E = 0, N = 7

    $73 * 137 * 137 = 1370137$




    Method:




    Divide both sides by $WON$

    $NO * WON = 10001 + (E000 / WON)$

    $ 0 <= E <= 9$


    First consider cases when $E$ is not $0$ and

    $(E000 / WON) = X $

    $E000 = E * 2^3 * 5^3$

    $N$ cannot be $0$ because $NO$ starts from it. So $WON$ cannot have both $2$s and $5$s as factors. If $WON$ does not have $5$s as factors it can be at most $9*2^3=72$ - not a three digit number. So $WON$ is an odd number divisible by $5$.


    Now $X$ is obviously not divisible by $5$ because

    $NO * WON = 10001 + X$


    So $WON$ has to be divisible by $125$. That makes $X <=72$. Which contradicts $10001 + X$ being divisible by 125. So we proved that

    $E = 0$ and

    $NO * WON = 10001$


    To get the last digit $1$ in the product with $N$ and $O$ being different digits we must have $NO = 37$ or $NO = 73$. $37$ is not a multiple of $10001$, so $NO = 73, WON = 137$







    share|improve this answer











    $endgroup$


















      11












      $begingroup$

      The answer is




      W = 1, O = 3, E = 0, N = 7

      $73 * 137 * 137 = 1370137$




      Method:




      Divide both sides by $WON$

      $NO * WON = 10001 + (E000 / WON)$

      $ 0 <= E <= 9$


      First consider cases when $E$ is not $0$ and

      $(E000 / WON) = X $

      $E000 = E * 2^3 * 5^3$

      $N$ cannot be $0$ because $NO$ starts from it. So $WON$ cannot have both $2$s and $5$s as factors. If $WON$ does not have $5$s as factors it can be at most $9*2^3=72$ - not a three digit number. So $WON$ is an odd number divisible by $5$.


      Now $X$ is obviously not divisible by $5$ because

      $NO * WON = 10001 + X$


      So $WON$ has to be divisible by $125$. That makes $X <=72$. Which contradicts $10001 + X$ being divisible by 125. So we proved that

      $E = 0$ and

      $NO * WON = 10001$


      To get the last digit $1$ in the product with $N$ and $O$ being different digits we must have $NO = 37$ or $NO = 73$. $37$ is not a multiple of $10001$, so $NO = 73, WON = 137$







      share|improve this answer











      $endgroup$
















        11












        11








        11





        $begingroup$

        The answer is




        W = 1, O = 3, E = 0, N = 7

        $73 * 137 * 137 = 1370137$




        Method:




        Divide both sides by $WON$

        $NO * WON = 10001 + (E000 / WON)$

        $ 0 <= E <= 9$


        First consider cases when $E$ is not $0$ and

        $(E000 / WON) = X $

        $E000 = E * 2^3 * 5^3$

        $N$ cannot be $0$ because $NO$ starts from it. So $WON$ cannot have both $2$s and $5$s as factors. If $WON$ does not have $5$s as factors it can be at most $9*2^3=72$ - not a three digit number. So $WON$ is an odd number divisible by $5$.


        Now $X$ is obviously not divisible by $5$ because

        $NO * WON = 10001 + X$


        So $WON$ has to be divisible by $125$. That makes $X <=72$. Which contradicts $10001 + X$ being divisible by 125. So we proved that

        $E = 0$ and

        $NO * WON = 10001$


        To get the last digit $1$ in the product with $N$ and $O$ being different digits we must have $NO = 37$ or $NO = 73$. $37$ is not a multiple of $10001$, so $NO = 73, WON = 137$







        share|improve this answer











        $endgroup$



        The answer is




        W = 1, O = 3, E = 0, N = 7

        $73 * 137 * 137 = 1370137$




        Method:




        Divide both sides by $WON$

        $NO * WON = 10001 + (E000 / WON)$

        $ 0 <= E <= 9$


        First consider cases when $E$ is not $0$ and

        $(E000 / WON) = X $

        $E000 = E * 2^3 * 5^3$

        $N$ cannot be $0$ because $NO$ starts from it. So $WON$ cannot have both $2$s and $5$s as factors. If $WON$ does not have $5$s as factors it can be at most $9*2^3=72$ - not a three digit number. So $WON$ is an odd number divisible by $5$.


        Now $X$ is obviously not divisible by $5$ because

        $NO * WON = 10001 + X$


        So $WON$ has to be divisible by $125$. That makes $X <=72$. Which contradicts $10001 + X$ being divisible by 125. So we proved that

        $E = 0$ and

        $NO * WON = 10001$


        To get the last digit $1$ in the product with $N$ and $O$ being different digits we must have $NO = 37$ or $NO = 73$. $37$ is not a multiple of $10001$, so $NO = 73, WON = 137$








        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited May 4 at 6:00

























        answered May 4 at 3:53









        ppgdevppgdev

        1,040310




        1,040310























            3












            $begingroup$


            W=1, O=3, N=7, E=0




            works because




            73 * 137 * 137 = 1370137.




            Also,




            W=O=N=E=0




            works, but I don't think that's what you meant.






            share|improve this answer









            $endgroup$









            • 1




              $begingroup$
              Welcome to Puzzling! (Take the Tour!) Regarding your "Also", the puzzle does say "four different digits" (emphasis added). :)
              $endgroup$
              – Rubio
              May 4 at 5:44










            • $begingroup$
              Thanks! And oops. :/
              $endgroup$
              – LarrySnyder610
              May 4 at 10:56
















            3












            $begingroup$


            W=1, O=3, N=7, E=0




            works because




            73 * 137 * 137 = 1370137.




            Also,




            W=O=N=E=0




            works, but I don't think that's what you meant.






            share|improve this answer









            $endgroup$









            • 1




              $begingroup$
              Welcome to Puzzling! (Take the Tour!) Regarding your "Also", the puzzle does say "four different digits" (emphasis added). :)
              $endgroup$
              – Rubio
              May 4 at 5:44










            • $begingroup$
              Thanks! And oops. :/
              $endgroup$
              – LarrySnyder610
              May 4 at 10:56














            3












            3








            3





            $begingroup$


            W=1, O=3, N=7, E=0




            works because




            73 * 137 * 137 = 1370137.




            Also,




            W=O=N=E=0




            works, but I don't think that's what you meant.






            share|improve this answer









            $endgroup$




            W=1, O=3, N=7, E=0




            works because




            73 * 137 * 137 = 1370137.




            Also,




            W=O=N=E=0




            works, but I don't think that's what you meant.







            share|improve this answer












            share|improve this answer



            share|improve this answer










            answered May 4 at 3:54









            LarrySnyder610LarrySnyder610

            23510




            23510








            • 1




              $begingroup$
              Welcome to Puzzling! (Take the Tour!) Regarding your "Also", the puzzle does say "four different digits" (emphasis added). :)
              $endgroup$
              – Rubio
              May 4 at 5:44










            • $begingroup$
              Thanks! And oops. :/
              $endgroup$
              – LarrySnyder610
              May 4 at 10:56














            • 1




              $begingroup$
              Welcome to Puzzling! (Take the Tour!) Regarding your "Also", the puzzle does say "four different digits" (emphasis added). :)
              $endgroup$
              – Rubio
              May 4 at 5:44










            • $begingroup$
              Thanks! And oops. :/
              $endgroup$
              – LarrySnyder610
              May 4 at 10:56








            1




            1




            $begingroup$
            Welcome to Puzzling! (Take the Tour!) Regarding your "Also", the puzzle does say "four different digits" (emphasis added). :)
            $endgroup$
            – Rubio
            May 4 at 5:44




            $begingroup$
            Welcome to Puzzling! (Take the Tour!) Regarding your "Also", the puzzle does say "four different digits" (emphasis added). :)
            $endgroup$
            – Rubio
            May 4 at 5:44












            $begingroup$
            Thanks! And oops. :/
            $endgroup$
            – LarrySnyder610
            May 4 at 10:56




            $begingroup$
            Thanks! And oops. :/
            $endgroup$
            – LarrySnyder610
            May 4 at 10:56











            1












            $begingroup$

            As this is not tagged "no-computers", I just used some Python :




            Solution : {'W': 1, 'O': 3, 'N': 7, 'E': 0}




            Method (Python) :





                def digit_sequence(string, digits): # string is sequence, digits are dictionairy with wone
            result=0
            for i in range(0, len(string)):
            result+=digits[string[i]]*(10**(len(string)-i-1))
            return result
            for W in range(0, 10):
            for O in range(0, 10):
            if W == O:
            continue
            for N in range(0, 10):
            if N == W or N == O:
            continue
            for E in range(0, 10):
            if E == W or E == O or E == N:
            continue
            # Four different digits W, O, N, E
            # Now check whether equation is fulfilled
            digits={"W": W, "O": O, "N": N, "E": E}
            if digit_sequence("NO", digits)*(digit_sequence("WON", digits)**2) == digit_sequence("WONEWON", digits):
            print("Solution : "+str(digits))





            share|improve this answer











            $endgroup$









            • 1




              $begingroup$
              I thought it might be fun to put together a solution that does this with an SMT solver, too. I used cryptol as my front-end, and I think it turned out pretty beautiful. Here it is in a gist just six lines long; an excerpt of interest is isSolution w o n e = all isDigit [w,o,n,e] / no*won*won == wonewon / no != 0.
              $endgroup$
              – Daniel Wagner
              May 4 at 17:29












            • $begingroup$
              You could add this as answer, too, @DanielWagner
              $endgroup$
              – LMD
              May 4 at 19:56












            • $begingroup$
              (This isn't PPCG though. Different mechanical means of arriving at the same result don't really provide any new information here. If you want to elaborate on an innovative method as your answer that's one thing; but just providing code that brute-forces the solution, or uses language or library functionality that keeps the actual mechanism mostly in a black box, is little better than stating 'the answer is X because magic'—it provides the same answer someone else already has, and does nothing to explain how to reach it. A comment is fine... an additional code answer probably isn't.)
              $endgroup$
              – Rubio
              May 4 at 23:40
















            1












            $begingroup$

            As this is not tagged "no-computers", I just used some Python :




            Solution : {'W': 1, 'O': 3, 'N': 7, 'E': 0}




            Method (Python) :





                def digit_sequence(string, digits): # string is sequence, digits are dictionairy with wone
            result=0
            for i in range(0, len(string)):
            result+=digits[string[i]]*(10**(len(string)-i-1))
            return result
            for W in range(0, 10):
            for O in range(0, 10):
            if W == O:
            continue
            for N in range(0, 10):
            if N == W or N == O:
            continue
            for E in range(0, 10):
            if E == W or E == O or E == N:
            continue
            # Four different digits W, O, N, E
            # Now check whether equation is fulfilled
            digits={"W": W, "O": O, "N": N, "E": E}
            if digit_sequence("NO", digits)*(digit_sequence("WON", digits)**2) == digit_sequence("WONEWON", digits):
            print("Solution : "+str(digits))





            share|improve this answer











            $endgroup$









            • 1




              $begingroup$
              I thought it might be fun to put together a solution that does this with an SMT solver, too. I used cryptol as my front-end, and I think it turned out pretty beautiful. Here it is in a gist just six lines long; an excerpt of interest is isSolution w o n e = all isDigit [w,o,n,e] / no*won*won == wonewon / no != 0.
              $endgroup$
              – Daniel Wagner
              May 4 at 17:29












            • $begingroup$
              You could add this as answer, too, @DanielWagner
              $endgroup$
              – LMD
              May 4 at 19:56












            • $begingroup$
              (This isn't PPCG though. Different mechanical means of arriving at the same result don't really provide any new information here. If you want to elaborate on an innovative method as your answer that's one thing; but just providing code that brute-forces the solution, or uses language or library functionality that keeps the actual mechanism mostly in a black box, is little better than stating 'the answer is X because magic'—it provides the same answer someone else already has, and does nothing to explain how to reach it. A comment is fine... an additional code answer probably isn't.)
              $endgroup$
              – Rubio
              May 4 at 23:40














            1












            1








            1





            $begingroup$

            As this is not tagged "no-computers", I just used some Python :




            Solution : {'W': 1, 'O': 3, 'N': 7, 'E': 0}




            Method (Python) :





                def digit_sequence(string, digits): # string is sequence, digits are dictionairy with wone
            result=0
            for i in range(0, len(string)):
            result+=digits[string[i]]*(10**(len(string)-i-1))
            return result
            for W in range(0, 10):
            for O in range(0, 10):
            if W == O:
            continue
            for N in range(0, 10):
            if N == W or N == O:
            continue
            for E in range(0, 10):
            if E == W or E == O or E == N:
            continue
            # Four different digits W, O, N, E
            # Now check whether equation is fulfilled
            digits={"W": W, "O": O, "N": N, "E": E}
            if digit_sequence("NO", digits)*(digit_sequence("WON", digits)**2) == digit_sequence("WONEWON", digits):
            print("Solution : "+str(digits))





            share|improve this answer











            $endgroup$



            As this is not tagged "no-computers", I just used some Python :




            Solution : {'W': 1, 'O': 3, 'N': 7, 'E': 0}




            Method (Python) :





                def digit_sequence(string, digits): # string is sequence, digits are dictionairy with wone
            result=0
            for i in range(0, len(string)):
            result+=digits[string[i]]*(10**(len(string)-i-1))
            return result
            for W in range(0, 10):
            for O in range(0, 10):
            if W == O:
            continue
            for N in range(0, 10):
            if N == W or N == O:
            continue
            for E in range(0, 10):
            if E == W or E == O or E == N:
            continue
            # Four different digits W, O, N, E
            # Now check whether equation is fulfilled
            digits={"W": W, "O": O, "N": N, "E": E}
            if digit_sequence("NO", digits)*(digit_sequence("WON", digits)**2) == digit_sequence("WONEWON", digits):
            print("Solution : "+str(digits))






            share|improve this answer














            share|improve this answer



            share|improve this answer








            edited May 4 at 13:19









            I N T E R E S T I N G

            9416




            9416










            answered May 4 at 13:03









            LMDLMD

            23319




            23319








            • 1




              $begingroup$
              I thought it might be fun to put together a solution that does this with an SMT solver, too. I used cryptol as my front-end, and I think it turned out pretty beautiful. Here it is in a gist just six lines long; an excerpt of interest is isSolution w o n e = all isDigit [w,o,n,e] / no*won*won == wonewon / no != 0.
              $endgroup$
              – Daniel Wagner
              May 4 at 17:29












            • $begingroup$
              You could add this as answer, too, @DanielWagner
              $endgroup$
              – LMD
              May 4 at 19:56












            • $begingroup$
              (This isn't PPCG though. Different mechanical means of arriving at the same result don't really provide any new information here. If you want to elaborate on an innovative method as your answer that's one thing; but just providing code that brute-forces the solution, or uses language or library functionality that keeps the actual mechanism mostly in a black box, is little better than stating 'the answer is X because magic'—it provides the same answer someone else already has, and does nothing to explain how to reach it. A comment is fine... an additional code answer probably isn't.)
              $endgroup$
              – Rubio
              May 4 at 23:40














            • 1




              $begingroup$
              I thought it might be fun to put together a solution that does this with an SMT solver, too. I used cryptol as my front-end, and I think it turned out pretty beautiful. Here it is in a gist just six lines long; an excerpt of interest is isSolution w o n e = all isDigit [w,o,n,e] / no*won*won == wonewon / no != 0.
              $endgroup$
              – Daniel Wagner
              May 4 at 17:29












            • $begingroup$
              You could add this as answer, too, @DanielWagner
              $endgroup$
              – LMD
              May 4 at 19:56












            • $begingroup$
              (This isn't PPCG though. Different mechanical means of arriving at the same result don't really provide any new information here. If you want to elaborate on an innovative method as your answer that's one thing; but just providing code that brute-forces the solution, or uses language or library functionality that keeps the actual mechanism mostly in a black box, is little better than stating 'the answer is X because magic'—it provides the same answer someone else already has, and does nothing to explain how to reach it. A comment is fine... an additional code answer probably isn't.)
              $endgroup$
              – Rubio
              May 4 at 23:40








            1




            1




            $begingroup$
            I thought it might be fun to put together a solution that does this with an SMT solver, too. I used cryptol as my front-end, and I think it turned out pretty beautiful. Here it is in a gist just six lines long; an excerpt of interest is isSolution w o n e = all isDigit [w,o,n,e] / no*won*won == wonewon / no != 0.
            $endgroup$
            – Daniel Wagner
            May 4 at 17:29






            $begingroup$
            I thought it might be fun to put together a solution that does this with an SMT solver, too. I used cryptol as my front-end, and I think it turned out pretty beautiful. Here it is in a gist just six lines long; an excerpt of interest is isSolution w o n e = all isDigit [w,o,n,e] / no*won*won == wonewon / no != 0.
            $endgroup$
            – Daniel Wagner
            May 4 at 17:29














            $begingroup$
            You could add this as answer, too, @DanielWagner
            $endgroup$
            – LMD
            May 4 at 19:56






            $begingroup$
            You could add this as answer, too, @DanielWagner
            $endgroup$
            – LMD
            May 4 at 19:56














            $begingroup$
            (This isn't PPCG though. Different mechanical means of arriving at the same result don't really provide any new information here. If you want to elaborate on an innovative method as your answer that's one thing; but just providing code that brute-forces the solution, or uses language or library functionality that keeps the actual mechanism mostly in a black box, is little better than stating 'the answer is X because magic'—it provides the same answer someone else already has, and does nothing to explain how to reach it. A comment is fine... an additional code answer probably isn't.)
            $endgroup$
            – Rubio
            May 4 at 23:40




            $begingroup$
            (This isn't PPCG though. Different mechanical means of arriving at the same result don't really provide any new information here. If you want to elaborate on an innovative method as your answer that's one thing; but just providing code that brute-forces the solution, or uses language or library functionality that keeps the actual mechanism mostly in a black box, is little better than stating 'the answer is X because magic'—it provides the same answer someone else already has, and does nothing to explain how to reach it. A comment is fine... an additional code answer probably isn't.)
            $endgroup$
            – Rubio
            May 4 at 23:40


















            draft saved

            draft discarded




















































            Thanks for contributing an answer to Puzzling 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%2fpuzzling.stackexchange.com%2fquestions%2f83601%2fno-won-won-wone-won%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

            Bruad Bilen | Luke uk diar | NawigatsjuunCommonskategorii: BruadCommonskategorii: RunstükenWikiquote: Bruad

            What is the offset in a seaplane's hull?

            Slayer Innehåll Historia | Stil, komposition och lyrik | Bandets betydelse och framgångar | Sidoprojekt och samarbeten | Kontroverser | Medlemmar | Utmärkelser och nomineringar | Turnéer och festivaler | Diskografi | Referenser | Externa länkar | Navigeringsmenywww.slayer.net”Metal Massacre vol. 1””Metal Massacre vol. 3””Metal Massacre Volume III””Show No Mercy””Haunting the Chapel””Live Undead””Hell Awaits””Reign in Blood””Reign in Blood””Gold & Platinum – Reign in Blood””Golden Gods Awards Winners”originalet”Kerrang! Hall Of Fame””Slayer Looks Back On 37-Year Career In New Video Series: Part Two””South of Heaven””Gold & Platinum – South of Heaven””Seasons in the Abyss””Gold & Platinum - Seasons in the Abyss””Divine Intervention””Divine Intervention - Release group by Slayer””Gold & Platinum - Divine Intervention””Live Intrusion””Undisputed Attitude””Abolish Government/Superficial Love””Release “Slatanic Slaughter: A Tribute to Slayer” by Various Artists””Diabolus in Musica””Soundtrack to the Apocalypse””God Hates Us All””Systematic - Relationships””War at the Warfield””Gold & Platinum - War at the Warfield””Soundtrack to the Apocalypse””Gold & Platinum - Still Reigning””Metallica, Slayer, Iron Mauden Among Winners At Metal Hammer Awards””Eternal Pyre””Eternal Pyre - Slayer release group””Eternal Pyre””Metal Storm Awards 2006””Kerrang! Hall Of Fame””Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Bullet-For My Valentine booed at Metal Hammer Golden Gods Awards””Unholy Aliance””The End Of Slayer?””Slayer: We Could Thrash Out Two More Albums If We're Fast Enough...””'The Unholy Alliance: Chapter III' UK Dates Added”originalet”Megadeth And Slayer To Co-Headline 'Canadian Carnage' Trek”originalet”World Painted Blood””Release “World Painted Blood” by Slayer””Metallica Heading To Cinemas””Slayer, Megadeth To Join Forces For 'European Carnage' Tour - Dec. 18, 2010”originalet”Slayer's Hanneman Contracts Acute Infection; Band To Bring In Guest Guitarist””Cannibal Corpse's Pat O'Brien Will Step In As Slayer's Guest Guitarist”originalet”Slayer’s Jeff Hanneman Dead at 49””Dave Lombardo Says He Made Only $67,000 In 2011 While Touring With Slayer””Slayer: We Do Not Agree With Dave Lombardo's Substance Or Timeline Of Events””Slayer Welcomes Drummer Paul Bostaph Back To The Fold””Slayer Hope to Unveil Never-Before-Heard Jeff Hanneman Material on Next Album””Slayer Debut New Song 'Implode' During Surprise Golden Gods Appearance””Release group Repentless by Slayer””Repentless - Slayer - Credits””Slayer””Metal Storm Awards 2015””Slayer - to release comic book "Repentless #1"””Slayer To Release 'Repentless' 6.66" Vinyl Box Set””BREAKING NEWS: Slayer Announce Farewell Tour””Slayer Recruit Lamb of God, Anthrax, Behemoth + Testament for Final Tour””Slayer lägger ner efter 37 år””Slayer Announces Second North American Leg Of 'Final' Tour””Final World Tour””Slayer Announces Final European Tour With Lamb of God, Anthrax And Obituary””Slayer To Tour Europe With Lamb of God, Anthrax And Obituary””Slayer To Play 'Last French Show Ever' At Next Year's Hellfst””Slayer's Final World Tour Will Extend Into 2019””Death Angel's Rob Cavestany On Slayer's 'Farewell' Tour: 'Some Of Us Could See This Coming'””Testament Has No Plans To Retire Anytime Soon, Says Chuck Billy””Anthrax's Scott Ian On Slayer's 'Farewell' Tour Plans: 'I Was Surprised And I Wasn't Surprised'””Slayer””Slayer's Morbid Schlock””Review/Rock; For Slayer, the Mania Is the Message””Slayer - Biography””Slayer - Reign In Blood”originalet”Dave Lombardo””An exclusive oral history of Slayer”originalet”Exclusive! Interview With Slayer Guitarist Jeff Hanneman”originalet”Thinking Out Loud: Slayer's Kerry King on hair metal, Satan and being polite””Slayer Lyrics””Slayer - Biography””Most influential artists for extreme metal music””Slayer - Reign in Blood””Slayer guitarist Jeff Hanneman dies aged 49””Slatanic Slaughter: A Tribute to Slayer””Gateway to Hell: A Tribute to Slayer””Covered In Blood””Slayer: The Origins of Thrash in San Francisco, CA.””Why They Rule - #6 Slayer”originalet”Guitar World's 100 Greatest Heavy Metal Guitarists Of All Time”originalet”The fans have spoken: Slayer comes out on top in readers' polls”originalet”Tribute to Jeff Hanneman (1964-2013)””Lamb Of God Frontman: We Sound Like A Slayer Rip-Off””BEHEMOTH Frontman Pays Tribute To SLAYER's JEFF HANNEMAN””Slayer, Hatebreed Doing Double Duty On This Year's Ozzfest””System of a Down””Lacuna Coil’s Andrea Ferro Talks Influences, Skateboarding, Band Origins + More””Slayer - Reign in Blood””Into The Lungs of Hell””Slayer rules - en utställning om fans””Slayer and Their Fans Slashed Through a No-Holds-Barred Night at Gas Monkey””Home””Slayer””Gold & Platinum - The Big 4 Live from Sofia, Bulgaria””Exclusive! Interview With Slayer Guitarist Kerry King””2008-02-23: Wiltern, Los Angeles, CA, USA””Slayer's Kerry King To Perform With Megadeth Tonight! - Oct. 21, 2010”originalet”Dave Lombardo - Biography”Slayer Case DismissedArkiveradUltimate Classic Rock: Slayer guitarist Jeff Hanneman dead at 49.”Slayer: "We could never do any thing like Some Kind Of Monster..."””Cannibal Corpse'S Pat O'Brien Will Step In As Slayer'S Guest Guitarist | The Official Slayer Site”originalet”Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Kerrang! Awards 2006 Blog: Kerrang! Hall Of Fame””Kerrang! Awards 2013: Kerrang! Legend”originalet”Metallica, Slayer, Iron Maien Among Winners At Metal Hammer Awards””Metal Hammer Golden Gods Awards””Bullet For My Valentine Booed At Metal Hammer Golden Gods Awards””Metal Storm Awards 2006””Metal Storm Awards 2015””Slayer's Concert History””Slayer - Relationships””Slayer - Releases”Slayers officiella webbplatsSlayer på MusicBrainzOfficiell webbplatsSlayerSlayerr1373445760000 0001 1540 47353068615-5086262726cb13906545x(data)6033143kn20030215029