Is it a row of Pascal's triangle?

Question

Pascal's triangle is a triangular diagram where the values of two numbers added together produce the one below them.

This is the start of it:

    1
   1 1
  1 2 1
 1 3 3 1
1 4 6 4 1

You can see that the outside is all 1s, and each number is the sum of the two above it. This continues forever.

Your challenge is to check whether a non-empty array of positive integers is a row of Pascal's triangle, somewhere down the line.

You should output two distinct values for truthy and falsy.

Scoring

This is code-golf, shortest wins.

Testcases

Truthy:

[1]
[1,2,1]
[1,3,3,1]
[1,5,10,10,5,1]
[1,6,15,20,15,6,1]
[1,7,21,35,35,21,7,1]

Falsy:

[2]
[1,2]
[1,1,2]
[2,2,2,2]
[1,2,10,2,1]
[1,2,3,4,5,6]
[1,3,5,10,5,3,1]

Answer 1

Haskell, 36 31 26 bytes

f[1]=1
f(1:b)=f$scanr1(-)b

Try it online!

This version errors as a false indicator and returns 1 as the true indicator. It's short but I generally find these sorts of answers a little cheaty so below I have a version with a more traditional output method:

42 37 32 bytes

f[1]=1
f(1:b)=f$scanr1(-)b
f _=0

Try it online!

Outputs 1 for yes and 0 for no.

This is I believe the only answer here using this method. We use scanr1(-) to calculate what the layer above would have to be in order to produce the input, and check if that new smaller layer holds. If we encounter [1] we halt with yes, because that is the first layer of Pascal's triangle. And if we encounter something starting with something other than 1 we halt with no.

Answer 2

Jelly, 6 bytes

L’cŻ$⁼

Try it online!

As each row of Pascal's triangle has a unique length \$n\$, all we have to do is reconstruct the row, given its length, and check if it equals the original input. As each row is given by \$\binom{n-1}{i}, 0 \le i < n\$, we just calculate that (as Jelly has a 1 byte for binomial coefficient)

In fact, if we can take the length of the input as a second input, we can get 5 bytes

How it works

L’cŻ$⁼ - Main link. Takes a list L on the left
L      - Length of L
 ’     - Decrement
    $  - Last 2 links as a monad f(len-1):
   Ż   -   Range from 0 to len-1
  c    -   Binomial coefficient of len-1 and each element in the range
     ⁼ - Does that equal the input?

Answer 3

R, 43 bytes

Or R>=4.1, 36 bytes by replacing the word function by \.

function(r)any(r-choose(x<-sum(r|1)-1,0:x))

Try it online!

Taking also length of input as second argument, we can shave 6 bytes off: Try it online!.

Answer 4

APL (Dyalog Unicode), 11 9 bytes

Saved 2 bytes thanks to Bubbler

⊢≡⍳∘≢!≢-≡

Try it online!

Requires 0-indexing.

⊢≡⍳∘≢!≢-≡
⊢         ⍝ Does the input
 ≡        ⍝ equal
  ⍳∘≢!≢-≡  ⍝ the row of Pascal's triangle with the same length?
     ≢-≡  ⍝ The number r of the real row that has the same length
     ≢    ⍝ The length of the input
      -≡  ⍝ Decremented/Minus the depth (which is always one)
  ⍳∘≢      ⍝ The column numbers for that row (a range [0..r])
    !     ⍝ Get the number at row r and column c for each element in the previous range

Answer 5

C (clang), 66 bytes

i,c,t;f(*p,n){for(t=c=i=1;i<=n;c=c*(n-i)/i++)t=t&&p[i-1]==c;*p=t;}

Try it online!

C (clang), 55 bytes

i,c;f(*p,n){for(c=i=1;i<=n;c=c*(n-i)/i++)c/=p[i-1]==c;}

Inspired by Wheat Wizards' post. Triggers a floating point exception for falsey.

Try it online!

Answer 6

Lean, 187 176 143 131 bytes

def q:list ℕ→bool:=λx,by{induction x,exact[],apply(::)1,induction x_ih with h t i,exact[],cases t,exact[h],exact(h+t_hd)::i}=x

Try it online!

A simpler version of this can be found below:

Lean, 190 185 169 bytes

def f:ℕ→list ℕ:=λn,by{induction n,exact[],apply(::)1,induction n_ih with h t i,exact[],cases t,exact[h],exact(h+t_hd)::i}
def g:list ℕ→bool:=λx,f(x.length)=x

Try it online!

This version defines a helper function f which gives the \$n\$th row of pascal's triangle. From here we check if the input is equal to the \$m\$th row where \$m\$ is the length of the input.

This is the straightforward way to do things.

The shorter version rolls these two into one. Instead of doing induction on the length of the list, it just does induction on the list itself. This turns the already hairy induction into a real mess.

Answer 7

Vyxal r, 6 bytes

₌ẏL‹ƈ⁼

Try it Online!

vyxal (and lyxal) is the best?

₌ẏL‹ƈ⁼
        (implicit input)
₌       parallel stuffs, do the next two command both on the stack top 
 ẏ      range of len(top)
  L     len(top)            currently stack [range(0,len),len]
   ‹    -1                                                len-1
    ƈ                       do combination caculation C(i,len-1) i= range(0,len)
     ⁼                      check equal     stack are not enough so input is used

Answer 8

BQN, 15 13 bytes^SBCS

-2 bytes thanks to Marshall Lochbaum

-˜`⍟≠≡1‿¯1⥊˜≠

Try it here.

Unlike many array languages, BQN doesn't have a binomial primitive, so a more creative solution is required.

-˜`⍟≠≡1‿¯1⥊˜≠ #
-˜`           # swapped minus scan
   ⍟≠         # repeated input length number of times
     ≡        # matches
      1‿¯1⥊˜≠ # alternating 1,-1 .. extended to the input length

Answer 9

Julia, 47 38 34 bytes

!l=binomial.((n=[l;0][2];),0:n)==l

Try it online!

Explanation

We just generate the n-th row of the Pascal triangle and test equality.

Thanks to amelies, we can get it down to 38 bytes!

Thanks to MarkMush, we can get it further down to 34 bytes!

Answer 10

Python 3, 66 bytes

f=lambda a,*r:r<a[1:]and f(a,*map(sum,zip(r,(1,*r))),1)or(1,*r)==a

Try it online!

Constructs the rows of Pascal's triangle recursively until a match is found or the generated row is larger than the input.

Answer 11

JavaScript (ES6), 46 bytes

Returns a Boolean value.

a=>!a.some(v=>v-n|(n*=a.length/q++-1)-n,q=n=1)

Try it online!

Answer 12

Factor + math.combinatorics, 47 bytes

[ dup length 1 - dup [0,b] [ nCk ] with map = ]

Try it online!

Explanation:

It's a quotation (anonymous function) that takes a sequence of numbers from the data stack as input and leaves a boolean on the data stack as output. Assuming { 1 3 3 1 } is on the data stack when this quotation is called...

• dup Duplicate the top object on the data stack.

  Stack: { 1 3 3 1 } { 1 3 3 1 }

• length Get the length of a sequence.

  Stack: { 1 3 3 1 } 4

• 1 - Subtract one.

  Stack: { 1 3 3 1 } 3

• dup Duplicate the top object on the data stack.

  Stack: { 1 3 3 1 } 3 3

• [0,b] Create a range from 0 to whatever is on top of the data stack, inclusive.

  Stack: { 1 3 3 1 } 3 T{ range f 0 4 1 }

• [ nCk ] with map Take \$\binom{3}{0}\$, \$\binom{3}{1}\$, ... \$\binom{3}{3}\$

  Stack: { 1 3 3 1 } { 1 3 3 1 }

• = Are the top two objects on the data stack equal?

  Stack: t

Answer 13

Wolfram Language (Mathematica), 38 bytes

Factor@Fold[x#-#+#2&,#]===x^--Tr[1^#]&

Try it online!

Checks that the polynomial in \$(x-1)\$ with these coefficients is a power of \$x\$.

Answer 14

Python 3.8 (pre-release), 69 bytes

lambda l:[math.comb(~-len(l),x)for x in range(len(l))]==l
import math

Try it online!

Luckily python 3.8 has a built-in for n choose k

Answer 15

05AB1E, 6 bytes

g<DÝcQ

Port of @cairdCoinheringaahing's Jelly answer.

Try it online or verify all test cases.

Explanation:

g       # Get the length of the (implicit) input-list
 <      # Decrease it by 1
  D     # Duplicate it
   Ý    # Pop the copy, and push a list in the range [0,length-1]
    c   # Get the binomial coefficient of length-1 with each integer in this list
     Q  # Check if this list is now equal to the (implicit) input-list
        # (after which the result is output implicitly)

Answer 16

Pascal (FPC), 165 bytes

function f(a:Array of Integer):integer;var i,n,c:Integer;begin
i:=1;c:=1;f:=1;n:=High(a)+1;for i:=1 to n do begin
if a[i-1]<>c then f:=0;c:=Trunc(c*(n-i)/i);end;end;

Try it online!

Answer 17

Perl 5, 45 44 bytes

sub{$n=$q=1;!grep$_-$n|($n*=@_/$q++-1)*0,@_}

Try it online!

A translation of the JavaScript answer from @Arnauld.

Answer 18

Pari/GP, 20 bytes

a->a==binomial(#a-1)

When binomial takes only one argument, it returns the n'th row of the Pascal's triangle.

Try it online!

Answer 19

Ruby, 51 bytes

->l{l.all?{r=0;*l,r=l.map{|x|r=x-r};r==(l[0]?0:1)}}

Try it online!

Answer 20

Pip -x, 20 14 bytes

L#al+:lPE!ll=a

Try it here! TIO doesn't support the -x flag, but you can simulate it using the header: Try it online!

Explanation

We generate the nth row of Pascal's triangle, where n is the length of the input list; then we output truthy if the row and the input are equal, falsey otherwise. Heavily based on my answer to Generate Pascal's triangle, which I recommend you read for a better explanation of the core algorithm.

                a is 1st cmdline arg, evaluated (-x flag); l is empty list
L               Loop
 #a              len(a) times:
         !l       1 if l is empty, 0 otherwise
      lPE         l with that value prepended
   l+:            Add to l itemwise and assign back to l
           l=a  1 if l equals a, 0 otherwise

Answer 21

Python 3.8 (pre-release), 71 68 bytes

lambda l:[*map(math.comb,(a:=len(l))*[a-1],range(a))]==l
import math

Try it online!

Using some list expansion shenanigans, it can be slightly shorter.

Old answer:

lambda l:list(map(math.comb,(a:=len(l))*[a-1],range(a)))==l
import math

Try it online!

Happily, Python has a built-in combination function. This just uses a simple mapping of that to build the row of Pascal's triangle corresponding to the length of the input list and compares that to the input.

Answer 22

Desmos, 62 48 bytes

Thanks Bubbler for -14 bytes.

The function \$f(l)\$ takes in a list of numbers, and returns 0 for falsey, 1 for truthy.

a=length(l)-1
f(l)=\min(\{l=\nCr(a,[0...a]),0\})

Try It On Desmos!

Try It On Desmos! - Prettified

Answer 23

Charcoal, 20 bytes

⬤θ⎇κ⁼×⁻Ｌθκ§θ⊖κ×κι⁼¹ι

Try it online! Link is to verbose version of code. Outputs a Charcoal boolean, i.e. - if it's a row, nothing if not. Explanation: The first element must always be 1. Subsequent elements obey the recurrence relation that the previous element multiplied by the inclusive number of elements remaining equals the current element multiplied by its index.

 θ                      Input array
⬤                       Do all elements satisfy
  ⎇κ                    If not first element then
          §θ⊖κ          Previous element
     ×                  Multiplied by
      ⁻Ｌθκ              Number of elements remaining
    ⁼                   Equals
              ×κι       Current element multiplied by its index
                 ⁼¹ι    If first element then it is `1`
                        Implicitly print