Pascal matrix generation: Difference between revisions

 

A pascal matrix is a two-dimensional square matrix holding numbers from &nbsp; [[Pascal's triangle]], &nbsp; also known as &nbsp; [[Evaluate binomial coefficients|binomial coefficients]] &nbsp; and which can be shown as &nbsp; <big>ⁿC_r.</big>

The &nbsp; [[Cholesky decomposition]] &nbsp; of a Pascal symmetric matrix is the Pascal lower-triangle matrix of the same size.

<br><br>

 

=={{header|11l}}==

{{trans|Python}}

<syntaxhighlight lang="11l">F pascal_upp(n)

V s = [[0] * n] * n

 

=={{header|BQN}}==

<code>C</code> is the combinations function, taken from BQNcrate. The rest of the problem is simple with table (<code>⌜</code>).

<syntaxhighlight lang="bqn">C←(-÷○(×´)1⊸+)⟜↕

=={{header|Delphi}}==

See [https://rosettacode.org/wiki/Pascal_matrix_generation Pascal].

=={{header|Elixir}}==

<syntaxhighlight lang="elixir">defmodule Pascal do

 

=={{header|J}}==

<syntaxhighlight lang="j"> !/~ i. 5

1 1 1 1 1

 

=={{header|Racket}}==

<syntaxhighlight lang="racket">#lang racket

(require math/number-theory)

 

=={{header|Stata}}==

Here are variants for the lower matrix.