Is this Pascal's Matrix?Diamondize a MatrixCalculate the Kronecker sum of two matricesMatrix TrigonometryFold up a matrix!Eigenvalues of a MatrixGenerate all square sub-matrices of a given sizeHermitian matrix?Is this a Weyr matrix?Is the matrix centrosymmetric… and so is the code?Matrix Jigsaw Puzzles

Exposing a company lying about themselves in a tightly knit industry: Is my career at risk on the long run?

When did hardware antialiasing start being available?

Interior of Set Notation

Writing in a Christian voice

Does fire aspect on a sword, destroy mob drops?

Should I be concerned about student access to a test bank?

How are passwords stolen from companies if they only store hashes?

Justification failure in beamer enumerate list

How can a new country break out from a developed country without war?

Weird lines in Microsoft Word

Air travel with refrigerated insulin

Print a physical multiplication table

How to read string as hex number in bash?

Homology of the fiber

Symbolism of 18 Journeyers

How can I create URL shortcuts/redirects for task/diff IDs in Phabricator?

Imaginary part of expression too difficult to calculate

What (if any) is the reason to buy in small local stores?

What is it called when someone votes for an option that's not their first choice?

Can "few" be used as a subject? If so, what is the rule?

CLI: Get information Ubuntu releases

Why is this tree refusing to shed its dead leaves?

What are the rules for concealing thieves' tools (or items in general)?

Why is indicated airspeed rather than ground speed used during the takeoff roll?



Is this Pascal's Matrix?


Diamondize a MatrixCalculate the Kronecker sum of two matricesMatrix TrigonometryFold up a matrix!Eigenvalues of a MatrixGenerate all square sub-matrices of a given sizeHermitian matrix?Is this a Weyr matrix?Is the matrix centrosymmetric… and so is the code?Matrix Jigsaw Puzzles













7












$begingroup$


In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:



Source: https://en.wikipedia.org/wiki/File:Pascal_triangle_small.png



By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top $1$. Here are some examples:



1 1 1 1
1 2 3 4
1 3 6 10
1 4 10 20

6 3 1
3 2 1
1 1 1

1 5 15 35 70
1 4 10 20 35
1 3 6 10 15
1 2 3 4 5
1 1 1 1 1

1

1 1
2 1


The Task



Given a square matrix containing positive numbers in any reasonable format, decide if it is a Pascal's matrix.



Decide means to either return truthy or falsy values depending on whether the input is a Pascal's matrix, or to fix two constant values and return one for the true inputs and the other for false inputs.



This is code-golf, so try to use as few bytes as possible in the language of your choice. The shortest code in each language wins, thus I will not accept an answer.



Test cases



True



[[1, 1, 1, 1], [1, 2, 3, 4], [1, 3, 6, 10], [1, 4, 10, 20]]
[[6, 3, 1], [3, 2, 1], [1, 1, 1]]
[[1, 5, 15, 35, 70], [1, 4, 10, 20, 35], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]
[[1]]
[[1, 1], [2, 1]]


False



[[2]]
[[1, 2], [2, 1]]
[[1, 1], [3, 1]]
[[1, 1, 1, 1], [1, 2, 3, 4], [1, 4, 6, 10], [1, 4, 10, 20]]
[[6, 3, 1], [1, 1, 1], [3, 2, 1]]
[[2, 2, 2, 2], [2, 4, 6, 8], [2, 6, 12, 20], [2, 8, 20, 40]]
[[1, 5, 15, 34, 70], [1, 4, 10, 20, 34], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]









share|improve this question









$endgroup$
















    7












    $begingroup$


    In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:



    Source: https://en.wikipedia.org/wiki/File:Pascal_triangle_small.png



    By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top $1$. Here are some examples:



    1 1 1 1
    1 2 3 4
    1 3 6 10
    1 4 10 20

    6 3 1
    3 2 1
    1 1 1

    1 5 15 35 70
    1 4 10 20 35
    1 3 6 10 15
    1 2 3 4 5
    1 1 1 1 1

    1

    1 1
    2 1


    The Task



    Given a square matrix containing positive numbers in any reasonable format, decide if it is a Pascal's matrix.



    Decide means to either return truthy or falsy values depending on whether the input is a Pascal's matrix, or to fix two constant values and return one for the true inputs and the other for false inputs.



    This is code-golf, so try to use as few bytes as possible in the language of your choice. The shortest code in each language wins, thus I will not accept an answer.



    Test cases



    True



    [[1, 1, 1, 1], [1, 2, 3, 4], [1, 3, 6, 10], [1, 4, 10, 20]]
    [[6, 3, 1], [3, 2, 1], [1, 1, 1]]
    [[1, 5, 15, 35, 70], [1, 4, 10, 20, 35], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]
    [[1]]
    [[1, 1], [2, 1]]


    False



    [[2]]
    [[1, 2], [2, 1]]
    [[1, 1], [3, 1]]
    [[1, 1, 1, 1], [1, 2, 3, 4], [1, 4, 6, 10], [1, 4, 10, 20]]
    [[6, 3, 1], [1, 1, 1], [3, 2, 1]]
    [[2, 2, 2, 2], [2, 4, 6, 8], [2, 6, 12, 20], [2, 8, 20, 40]]
    [[1, 5, 15, 34, 70], [1, 4, 10, 20, 34], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]









    share|improve this question









    $endgroup$














      7












      7








      7


      1



      $begingroup$


      In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:



      Source: https://en.wikipedia.org/wiki/File:Pascal_triangle_small.png



      By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top $1$. Here are some examples:



      1 1 1 1
      1 2 3 4
      1 3 6 10
      1 4 10 20

      6 3 1
      3 2 1
      1 1 1

      1 5 15 35 70
      1 4 10 20 35
      1 3 6 10 15
      1 2 3 4 5
      1 1 1 1 1

      1

      1 1
      2 1


      The Task



      Given a square matrix containing positive numbers in any reasonable format, decide if it is a Pascal's matrix.



      Decide means to either return truthy or falsy values depending on whether the input is a Pascal's matrix, or to fix two constant values and return one for the true inputs and the other for false inputs.



      This is code-golf, so try to use as few bytes as possible in the language of your choice. The shortest code in each language wins, thus I will not accept an answer.



      Test cases



      True



      [[1, 1, 1, 1], [1, 2, 3, 4], [1, 3, 6, 10], [1, 4, 10, 20]]
      [[6, 3, 1], [3, 2, 1], [1, 1, 1]]
      [[1, 5, 15, 35, 70], [1, 4, 10, 20, 35], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]
      [[1]]
      [[1, 1], [2, 1]]


      False



      [[2]]
      [[1, 2], [2, 1]]
      [[1, 1], [3, 1]]
      [[1, 1, 1, 1], [1, 2, 3, 4], [1, 4, 6, 10], [1, 4, 10, 20]]
      [[6, 3, 1], [1, 1, 1], [3, 2, 1]]
      [[2, 2, 2, 2], [2, 4, 6, 8], [2, 6, 12, 20], [2, 8, 20, 40]]
      [[1, 5, 15, 34, 70], [1, 4, 10, 20, 34], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]









      share|improve this question









      $endgroup$




      In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:



      Source: https://en.wikipedia.org/wiki/File:Pascal_triangle_small.png



      By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top $1$. Here are some examples:



      1 1 1 1
      1 2 3 4
      1 3 6 10
      1 4 10 20

      6 3 1
      3 2 1
      1 1 1

      1 5 15 35 70
      1 4 10 20 35
      1 3 6 10 15
      1 2 3 4 5
      1 1 1 1 1

      1

      1 1
      2 1


      The Task



      Given a square matrix containing positive numbers in any reasonable format, decide if it is a Pascal's matrix.



      Decide means to either return truthy or falsy values depending on whether the input is a Pascal's matrix, or to fix two constant values and return one for the true inputs and the other for false inputs.



      This is code-golf, so try to use as few bytes as possible in the language of your choice. The shortest code in each language wins, thus I will not accept an answer.



      Test cases



      True



      [[1, 1, 1, 1], [1, 2, 3, 4], [1, 3, 6, 10], [1, 4, 10, 20]]
      [[6, 3, 1], [3, 2, 1], [1, 1, 1]]
      [[1, 5, 15, 35, 70], [1, 4, 10, 20, 35], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]
      [[1]]
      [[1, 1], [2, 1]]


      False



      [[2]]
      [[1, 2], [2, 1]]
      [[1, 1], [3, 1]]
      [[1, 1, 1, 1], [1, 2, 3, 4], [1, 4, 6, 10], [1, 4, 10, 20]]
      [[6, 3, 1], [1, 1, 1], [3, 2, 1]]
      [[2, 2, 2, 2], [2, 4, 6, 8], [2, 6, 12, 20], [2, 8, 20, 40]]
      [[1, 5, 15, 34, 70], [1, 4, 10, 20, 34], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]






      code-golf decision-problem matrix






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 5 hours ago









      LaikoniLaikoni

      20.2k438101




      20.2k438101




















          3 Answers
          3






          active

          oldest

          votes


















          1












          $begingroup$


          Brachylog, 28 bytes



          This feels quite long but here it is anyway



          -4 bytes thanks to DLosc



          ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


          Explanation



          ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
          ↔↰₁ # By trying to get a rows of 1's on top
          ↔ # Through optionally mirroring vertically
          # Transposing
          ↰₁ # Through optionally mirroring vertically

          h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
          h=₁ # first row is a rows of 1's
          s₂ᶠ # and for each 2 rows which follow each other
          ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
          a₀ᶠ # take all prefixes of the 1st
          +ᵐ # which if summed are the 2nd


          Try it online!






          share|improve this answer











          $endgroup$












          • $begingroup$
            First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
            $endgroup$
            – DLosc
            3 hours ago


















          0












          $begingroup$


          Charcoal, 41 bytes



          F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


          Try it online! Link is to verbose version of code. Explanation:



          F‹¹⌈§θ⁰


          If the minimum of its first row is greater than 1,



          ≔⮌θθ


          then flip the input array.



          F‹¹⌈Eθ§ι⁰


          If the minimum of its first column is greater than 1,



          ≦⮌θ


          then mirror the input array.



          ⌊⭆θ⭆ι


          Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



          ⁼λ∨¬κΣ…§θ⊖κ⊕μ


          comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.






          share|improve this answer









          $endgroup$




















            0












            $begingroup$

            JavaScript (ES6), 114 bytes





            m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


            Try it online!






            share|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.ifUsing("editor", function ()
              StackExchange.using("externalEditor", function ()
              StackExchange.using("snippets", function ()
              StackExchange.snippets.init();
              );
              );
              , "code-snippets");

              StackExchange.ready(function()
              var channelOptions =
              tags: "".split(" "),
              id: "200"
              ;
              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
              ,
              onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              );



              );













              draft saved

              draft discarded


















              StackExchange.ready(
              function ()
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f181742%2fis-this-pascals-matrix%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









              1












              $begingroup$


              Brachylog, 28 bytes



              This feels quite long but here it is anyway



              -4 bytes thanks to DLosc



              ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


              Explanation



              ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
              ↔↰₁ # By trying to get a rows of 1's on top
              ↔ # Through optionally mirroring vertically
              # Transposing
              ↰₁ # Through optionally mirroring vertically

              h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
              h=₁ # first row is a rows of 1's
              s₂ᶠ # and for each 2 rows which follow each other
              ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
              a₀ᶠ # take all prefixes of the 1st
              +ᵐ # which if summed are the 2nd


              Try it online!






              share|improve this answer











              $endgroup$












              • $begingroup$
                First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
                $endgroup$
                – DLosc
                3 hours ago















              1












              $begingroup$


              Brachylog, 28 bytes



              This feels quite long but here it is anyway



              -4 bytes thanks to DLosc



              ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


              Explanation



              ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
              ↔↰₁ # By trying to get a rows of 1's on top
              ↔ # Through optionally mirroring vertically
              # Transposing
              ↰₁ # Through optionally mirroring vertically

              h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
              h=₁ # first row is a rows of 1's
              s₂ᶠ # and for each 2 rows which follow each other
              ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
              a₀ᶠ # take all prefixes of the 1st
              +ᵐ # which if summed are the 2nd


              Try it online!






              share|improve this answer











              $endgroup$












              • $begingroup$
                First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
                $endgroup$
                – DLosc
                3 hours ago













              1












              1








              1





              $begingroup$


              Brachylog, 28 bytes



              This feels quite long but here it is anyway



              -4 bytes thanks to DLosc



              ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


              Explanation



              ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
              ↔↰₁ # By trying to get a rows of 1's on top
              ↔ # Through optionally mirroring vertically
              # Transposing
              ↰₁ # Through optionally mirroring vertically

              h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
              h=₁ # first row is a rows of 1's
              s₂ᶠ # and for each 2 rows which follow each other
              ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
              a₀ᶠ # take all prefixes of the 1st
              +ᵐ # which if summed are the 2nd


              Try it online!






              share|improve this answer











              $endgroup$




              Brachylog, 28 bytes



              This feels quite long but here it is anyway



              -4 bytes thanks to DLosc



              ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


              Explanation



              ↔↰₁h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
              ↔↰₁ # By trying to get a rows of 1's on top
              ↔ # Through optionally mirroring vertically
              # Transposing
              ↰₁ # Through optionally mirroring vertically

              h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
              h=₁ # first row is a rows of 1's
              s₂ᶠ # and for each 2 rows which follow each other
              ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
              a₀ᶠ # take all prefixes of the 1st
              +ᵐ # which if summed are the 2nd


              Try it online!







              share|improve this answer














              share|improve this answer



              share|improve this answer








              edited 48 mins ago

























              answered 4 hours ago









              KroppebKroppeb

              1,326210




              1,326210











              • $begingroup$
                First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
                $endgroup$
                – DLosc
                3 hours ago
















              • $begingroup$
                First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
                $endgroup$
                – DLosc
                3 hours ago















              $begingroup$
              First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
              $endgroup$
              – DLosc
              3 hours ago




              $begingroup$
              First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
              $endgroup$
              – DLosc
              3 hours ago











              0












              $begingroup$


              Charcoal, 41 bytes



              F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


              Try it online! Link is to verbose version of code. Explanation:



              F‹¹⌈§θ⁰


              If the minimum of its first row is greater than 1,



              ≔⮌θθ


              then flip the input array.



              F‹¹⌈Eθ§ι⁰


              If the minimum of its first column is greater than 1,



              ≦⮌θ


              then mirror the input array.



              ⌊⭆θ⭆ι


              Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



              ⁼λ∨¬κΣ…§θ⊖κ⊕μ


              comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.






              share|improve this answer









              $endgroup$

















                0












                $begingroup$


                Charcoal, 41 bytes



                F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


                Try it online! Link is to verbose version of code. Explanation:



                F‹¹⌈§θ⁰


                If the minimum of its first row is greater than 1,



                ≔⮌θθ


                then flip the input array.



                F‹¹⌈Eθ§ι⁰


                If the minimum of its first column is greater than 1,



                ≦⮌θ


                then mirror the input array.



                ⌊⭆θ⭆ι


                Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



                ⁼λ∨¬κΣ…§θ⊖κ⊕μ


                comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.






                share|improve this answer









                $endgroup$















                  0












                  0








                  0





                  $begingroup$


                  Charcoal, 41 bytes



                  F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


                  Try it online! Link is to verbose version of code. Explanation:



                  F‹¹⌈§θ⁰


                  If the minimum of its first row is greater than 1,



                  ≔⮌θθ


                  then flip the input array.



                  F‹¹⌈Eθ§ι⁰


                  If the minimum of its first column is greater than 1,



                  ≦⮌θ


                  then mirror the input array.



                  ⌊⭆θ⭆ι


                  Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



                  ⁼λ∨¬κΣ…§θ⊖κ⊕μ


                  comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.






                  share|improve this answer









                  $endgroup$




                  Charcoal, 41 bytes



                  F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


                  Try it online! Link is to verbose version of code. Explanation:



                  F‹¹⌈§θ⁰


                  If the minimum of its first row is greater than 1,



                  ≔⮌θθ


                  then flip the input array.



                  F‹¹⌈Eθ§ι⁰


                  If the minimum of its first column is greater than 1,



                  ≦⮌θ


                  then mirror the input array.



                  ⌊⭆θ⭆ι


                  Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



                  ⁼λ∨¬κΣ…§θ⊖κ⊕μ


                  comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 3 hours ago









                  NeilNeil

                  81.7k745178




                  81.7k745178





















                      0












                      $begingroup$

                      JavaScript (ES6), 114 bytes





                      m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


                      Try it online!






                      share|improve this answer









                      $endgroup$

















                        0












                        $begingroup$

                        JavaScript (ES6), 114 bytes





                        m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


                        Try it online!






                        share|improve this answer









                        $endgroup$















                          0












                          0








                          0





                          $begingroup$

                          JavaScript (ES6), 114 bytes





                          m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


                          Try it online!






                          share|improve this answer









                          $endgroup$



                          JavaScript (ES6), 114 bytes





                          m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


                          Try it online!







                          share|improve this answer












                          share|improve this answer



                          share|improve this answer










                          answered 2 hours ago









                          ArnauldArnauld

                          79k795328




                          79k795328



























                              draft saved

                              draft discarded
















































                              If this is an answer to a challenge…



                              • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


                              • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
                                Explanations of your answer make it more interesting to read and are very much encouraged.


                              • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.


                              More generally…



                              • …Please make sure to answer the question and provide sufficient detail.


                              • …Avoid asking for help, clarification or responding to other answers (use comments instead).




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function ()
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f181742%2fis-this-pascals-matrix%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

                              Францішак Багушэвіч Змест Сям'я | Біяграфія | Творчасць | Мова Багушэвіча | Ацэнкі дзейнасці | Цікавыя факты | Спадчына | Выбраная бібліяграфія | Ушанаванне памяці | У філатэліі | Зноскі | Літаратура | Спасылкі | НавігацыяЛяхоўскі У. Рупіўся дзеля Бога і людзей: Жыццёвы шлях Лявона Вітан-Дубейкаўскага // Вольскі і Памідораў з песняй пра немца Адвакат, паэт, народны заступнік Ашмянскі веснікВ Минске появится площадь Богушевича и улица Сырокомли, Белорусская деловая газета, 19 июля 2001 г.Айцец беларускай нацыянальнай ідэі паўстаў у бронзе Сяргей Аляксандравіч Адашкевіч (1918, Мінск). 80-я гады. Бюст «Францішак Багушэвіч».Яўген Мікалаевіч Ціхановіч. «Партрэт Францішка Багушэвіча»Мікола Мікалаевіч Купава. «Партрэт зачынальніка новай беларускай літаратуры Францішка Багушэвіча»Уладзімір Іванавіч Мелехаў. На помніку «Змагарам за родную мову» Барэльеф «Францішак Багушэвіч»Памяць пра Багушэвіча на Віленшчыне Страчаная сталіца. Беларускія шыльды на вуліцах Вільні«Krynica». Ideologia i przywódcy białoruskiego katolicyzmuФранцішак БагушэвічТворы на knihi.comТворы Францішка Багушэвіча на bellib.byСодаль Уладзімір. Францішак Багушэвіч на Лідчыне;Луцкевіч Антон. Жыцьцё і творчасьць Фр. Багушэвіча ў успамінах ягоных сучасьнікаў // Запісы Беларускага Навуковага таварыства. Вільня, 1938. Сшытак 1. С. 16-34.Большая российская1188761710000 0000 5537 633Xn9209310021619551927869394п

                              Беларусь Змест Назва Гісторыя Геаграфія Сімволіка Дзяржаўны лад Палітычныя партыі Міжнароднае становішча і знешняя палітыка Адміністрацыйны падзел Насельніцтва Эканоміка Культура і грамадства Сацыяльная сфера Узброеныя сілы Заўвагі Літаратура Спасылкі НавігацыяHGЯOiТоп-2011 г. (па версіі ej.by)Топ-2013 г. (па версіі ej.by)Топ-2016 г. (па версіі ej.by)Топ-2017 г. (па версіі ej.by)Нацыянальны статыстычны камітэт Рэспублікі БеларусьШчыльнасць насельніцтва па краінахhttp://naviny.by/rubrics/society/2011/09/16/ic_articles_116_175144/А. Калечыц, У. Ксяндзоў. Спробы засялення краю неандэртальскім чалавекам.І ў Менску былі мамантыА. Калечыц, У. Ксяндзоў. Старажытны каменны век (палеаліт). Першапачатковае засяленне тэрыторыіГ. Штыхаў. Балты і славяне ў VI—VIII стст.М. Клімаў. Полацкае княства ў IX—XI стст.Г. Штыхаў, В. Ляўко. Палітычная гісторыя Полацкай зямліГ. Штыхаў. Дзяржаўны лад у землях-княствахГ. Штыхаў. Дзяржаўны лад у землях-княствахБеларускія землі ў складзе Вялікага Княства ЛітоўскагаЛюблінская унія 1569 г."The Early Stages of Independence"Zapomniane prawdy25 гадоў таму было аб'яўлена, што Язэп Пілсудскі — беларус (фота)Наша вадаДакументы ЧАЭС: Забруджванне тэрыторыі Беларусі « ЧАЭС Зона адчужэнняСведения о политических партиях, зарегистрированных в Республике Беларусь // Министерство юстиции Республики БеларусьСтатыстычны бюлетэнь „Полаўзроставая структура насельніцтва Рэспублікі Беларусь на 1 студзеня 2012 года і сярэднегадовая колькасць насельніцтва за 2011 год“Индекс человеческого развития Беларуси — не было бы нижеБеларусь занимает первое место в СНГ по индексу развития с учетом гендерного факцёраНацыянальны статыстычны камітэт Рэспублікі БеларусьКанстытуцыя РБ. Артыкул 17Трансфармацыйныя задачы БеларусіВыйсце з крызісу — далейшае рэфармаванне Беларускі рубель — сусветны лідар па дэвальвацыяхПра змену коштаў у кастрычніку 2011 г.Бядней за беларусаў у СНД толькі таджыкіСярэдні заробак у верасні дасягнуў 2,26 мільёна рублёўЭканомікаГаласуем за ТОП-100 беларускай прозыСучасныя беларускія мастакіАрхитектура Беларуси BELARUS.BYА. Каханоўскі. Культура Беларусі ўсярэдзіне XVII—XVIII ст.Анталогія беларускай народнай песні, гуказапісы спеваўБеларускія Музычныя IнструментыБеларускі рок, які мы страцілі. Топ-10 гуртоў«Мясцовы час» — нязгаслая легенда беларускай рок-музыкіСЯРГЕЙ БУДКІН. МЫ НЯ ЗНАЕМ СВАЁЙ МУЗЫКІМ. А. Каладзінскі. НАРОДНЫ ТЭАТРМагнацкія культурныя цэнтрыПублічная дыскусія «Беларуская новая пьеса: без беларускай мовы ці беларуская?»Беларускія драматургі па-ранейшаму лепш ставяцца за мяжой, чым на радзіме«Працэс незалежнага кіно пайшоў, і дзяржаву турбуе яго непадкантрольнасць»Беларускія філосафы ў пошуках прасторыВсе идём в библиотекуАрхіваванаАб Нацыянальнай праграме даследавання і выкарыстання касмічнай прасторы ў мірных мэтах на 2008—2012 гадыУ космас — разам.У суседнім з Барысаўскім раёне пабудуюць Камандна-вымяральны пунктСвяты і абрады беларусаў«Мірныя бульбашы з малой краіны» — 5 непраўдзівых стэрэатыпаў пра БеларусьМ. Раманюк. Беларускае народнае адзеннеУ Беларусі скарачаецца колькасць злачынстваўЛукашэнка незадаволены мінскімі ўладамі Крадзяжы складаюць у Мінску каля 70% злачынстваў Узровень злачыннасці ў Мінскай вобласці — адзін з самых высокіх у краіне Генпракуратура аналізуе стан са злачыннасцю ў Беларусі па каэфіцыенце злачыннасці У Беларусі стабілізавалася крымінагеннае становішча, лічыць генпракурорЗамежнікі сталі здзяйсняць у Беларусі больш злачынстваўМУС Беларусі турбуе рост рэцыдыўнай злачыннасціЯ з ЖЭСа. Дазволіце вас абкрасці! Рэйтынг усіх службаў і падраздзяленняў ГУУС Мінгарвыканкама вырасАб КДБ РБГісторыя Аператыўна-аналітычнага цэнтра РБГісторыя ДКФРТаможняagentura.ruБеларусьBelarus.by — Афіцыйны сайт Рэспублікі БеларусьСайт урада БеларусіRadzima.org — Збор архітэктурных помнікаў, гісторыя Беларусі«Глобус Беларуси»Гербы и флаги БеларусиАсаблівасці каменнага веку на БеларусіА. Калечыц, У. Ксяндзоў. Старажытны каменны век (палеаліт). Першапачатковае засяленне тэрыторыіУ. Ксяндзоў. Сярэдні каменны век (мезаліт). Засяленне краю плямёнамі паляўнічых, рыбакоў і збіральнікаўА. Калечыц, М. Чарняўскі. Плямёны на тэрыторыі Беларусі ў новым каменным веку (неаліце)А. Калечыц, У. Ксяндзоў, М. Чарняўскі. Гаспадарчыя заняткі ў каменным векуЭ. Зайкоўскі. Духоўная культура ў каменным векуАсаблівасці бронзавага веку на БеларусіФарміраванне супольнасцей ранняга перыяду бронзавага векуФотографии БеларусиРоля беларускіх зямель ва ўтварэнні і ўмацаванні ВКЛВ. Фадзеева. З гісторыі развіцця беларускай народнай вышыўкіDMOZGran catalanaБольшая российскаяBritannica (анлайн)Швейцарскі гістарычны15325917611952699xDA123282154079143-90000 0001 2171 2080n9112870100577502ge128882171858027501086026362074122714179пппппп

                              ValueError: Expected n_neighbors <= n_samples, but n_samples = 1, n_neighbors = 6 (SMOTE) The 2019 Stack Overflow Developer Survey Results Are InCan SMOTE be applied over sequence of words (sentences)?ValueError when doing validation with random forestsSMOTE and multi class oversamplingLogic behind SMOTE-NC?ValueError: Error when checking target: expected dense_1 to have shape (7,) but got array with shape (1,)SmoteBoost: Should SMOTE be ran individually for each iteration/tree in the boosting?solving multi-class imbalance classification using smote and OSSUsing SMOTE for Synthetic Data generation to improve performance on unbalanced dataproblem of entry format for a simple model in KerasSVM SMOTE fit_resample() function runs forever with no result