di-zhang-fdu/OlympiadExtended huggingface dataset:
Subfield: Combinatorics


Question: The arrangement of numbers known as Pascal's Triangle has fascinated mathematicians for centuries. In fact, about 700 years before Pascal, the Indian mathematician Halayudha wrote about it in his commentaries to a then-1000-year-old treatise on verse structure by the Indian poet and mathematician Pingala, who called it the Meruprastāra, or "Mountain of Gems". In this Power Question, we'll explore some properties of Pingala's/Pascal's Triangle ("PT") and its variants.

Unless otherwise specified, the only definition, notation, and formulas you may use for PT are the definition, notation, and formulas given below.

PT consists of an infinite number of rows, numbered from 0 onwards. The $n^{\text {th }}$ row contains $n+1$ numbers, identified as $\mathrm{Pa}(n, k)$, where $0 \leq k \leq n$. For all $n$, define $\mathrm{Pa}(n, 0)=\operatorname{Pa}(n, n)=1$. Then for $n>1$ and $1 \leq k \leq n-1$, define $\mathrm{Pa}(n, k)=\mathrm{Pa}(n-1, k-1)+\mathrm{Pa}(n-1, k)$. It is convenient to define $\mathrm{Pa}(n, k)=0$ when $k<0$ or $k>n$. We write the nonzero values of $\mathrm{PT}$ in the familiar pyramid shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_b0415e12b85f62aa86deg-1.jpg?height=420&width=1201&top_left_y=1015&top_left_x=473)

As is well known, $\mathrm{Pa}(n, k)$ gives the number of ways of choosing a committee of $k$ people from a set of $n$ people, so a simple formula for $\mathrm{Pa}(n, k)$ is $\mathrm{Pa}(n, k)=\frac{n !}{k !(n-k) !}$. You may use this formula or the recursive definition above throughout this Power Question.

Clark's Triangle: If the left side of PT is replaced with consecutive multiples of 6 , starting with 0 , but the right entries (except the first) and the generating rule are left unchanged, the result is called Clark's Triangle. If the $k^{\text {th }}$ entry of the $n^{\text {th }}$ row is denoted by $\mathrm{Cl}(n, k)$, then the formal rule is:

$$
\begin{cases}\mathrm{Cl}(n, 0)=6 n & \text { for all } n \\ \mathrm{Cl}(n, n)=1 & \text { for } n \geq 1 \\ \mathrm{Cl}(n, k)=\mathrm{Cl}(n-1, k-1)+\mathrm{Cl}(n-1, k) & \text { for } n \geq 1 \text { and } 1 \leq k \leq n-1\end{cases}
$$

The first four rows of Clark's Triangle are given below.

![](https://cdn.mathpix.com/cropped/2023_12_21_c41919b703ea0b966244g-1.jpg?height=412&width=1152&top_left_y=1602&top_left_x=476)
Compute $\mathrm{Cl}(11,2)$.

Solution:
$\mathrm{Cl}(11,2)=1000$.

Final answer: 1000
Subfield: Combinatorics


Question: The arrangement of numbers known as Pascal's Triangle has fascinated mathematicians for centuries. In fact, about 700 years before Pascal, the Indian mathematician Halayudha wrote about it in his commentaries to a then-1000-year-old treatise on verse structure by the Indian poet and mathematician Pingala, who called it the Meruprastāra, or "Mountain of Gems". In this Power Question, we'll explore some properties of Pingala's/Pascal's Triangle ("PT") and its variants.

Unless otherwise specified, the only definition, notation, and formulas you may use for PT are the definition, notation, and formulas given below.

PT consists of an infinite number of rows, numbered from 0 onwards. The $n^{\text {th }}$ row contains $n+1$ numbers, identified as $\mathrm{Pa}(n, k)$, where $0 \leq k \leq n$. For all $n$, define $\mathrm{Pa}(n, 0)=\operatorname{Pa}(n, n)=1$. Then for $n>1$ and $1 \leq k \leq n-1$, define $\mathrm{Pa}(n, k)=\mathrm{Pa}(n-1, k-1)+\mathrm{Pa}(n-1, k)$. It is convenient to define $\mathrm{Pa}(n, k)=0$ when $k<0$ or $k>n$. We write the nonzero values of $\mathrm{PT}$ in the familiar pyramid shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_b0415e12b85f62aa86deg-1.jpg?height=420&width=1201&top_left_y=1015&top_left_x=473)

As is well known, $\mathrm{Pa}(n, k)$ gives the number of ways of choosing a committee of $k$ people from a set of $n$ people, so a simple formula for $\mathrm{Pa}(n, k)$ is $\mathrm{Pa}(n, k)=\frac{n !}{k !(n-k) !}$. You may use this formula or the recursive definition above throughout this Power Question.

Clark's Triangle: If the left side of PT is replaced with consecutive multiples of 6 , starting with 0 , but the right entries (except the first) and the generating rule are left unchanged, the result is called Clark's Triangle. If the $k^{\text {th }}$ entry of the $n^{\text {th }}$ row is denoted by $\mathrm{Cl}(n, k)$, then the formal rule is:

$$
\begin{cases}\mathrm{Cl}(n, 0)=6 n & \text { for all } n \\ \mathrm{Cl}(n, n)=1 & \text { for } n \geq 1 \\ \mathrm{Cl}(n, k)=\mathrm{Cl}(n-1, k-1)+\mathrm{Cl}(n-1, k) & \text { for } n \geq 1 \text { and } 1 \leq k \leq n-1\end{cases}
$$

The first four rows of Clark's Triangle are given below.

![](https://cdn.mathpix.com/cropped/2023_12_21_c41919b703ea0b966244g-1.jpg?height=412&width=1152&top_left_y=1602&top_left_x=476)
Find and justify a formula for $\mathrm{Cl}(n, 2)$ in terms of $n$.

Solution:
$\mathrm{Cl}(n, 2)=(n-1)^{3}$. Use induction on $n$. First, rewrite $\mathrm{Cl}(n, 1)=3 n^{2}-3 n+1=n^{3}-(n-1)^{3}$, and notice that $\mathrm{Cl}(2,2)=1=(2-1)^{3}$. Then if $\mathrm{Cl}(n, 2)=(n-1)^{3}$, using the recursive definition, $\mathrm{Cl}(n+1,2)=\mathrm{Cl}(n, 2)+\mathrm{Cl}(n, 1)=(n-1)^{3}+\left(n^{3}-(n-1)^{3}\right)=n^{3}$.

Final answer: $\mathrm{Cl}(n, 2)=(n-1)^{3}$. Use induction on $n$. First, rewrite $\mathrm{Cl}(n, 1)=3 n^{2}-3 n+1=n^{3}-(n-1)^{3}$, and notice that $\mathrm{Cl}(2,2)=1=(2-1)^{3}$. Then if $\mathrm{Cl}(n, 2)=(n-1)^{3}$, using the recursive definition, $\mathrm{Cl}(n+1,2)=\mathrm{Cl}(n, 2)+\mathrm{Cl}(n, 1)=(n-1)^{3}+\left(n^{3}-(n-1)^{3}\right)=n^{3}$.
Subfield: Combinatorics


Question: The arrangement of numbers known as Pascal's Triangle has fascinated mathematicians for centuries. In fact, about 700 years before Pascal, the Indian mathematician Halayudha wrote about it in his commentaries to a then-1000-year-old treatise on verse structure by the Indian poet and mathematician Pingala, who called it the Meruprastāra, or "Mountain of Gems". In this Power Question, we'll explore some properties of Pingala's/Pascal's Triangle ("PT") and its variants.

Unless otherwise specified, the only definition, notation, and formulas you may use for PT are the definition, notation, and formulas given below.

PT consists of an infinite number of rows, numbered from 0 onwards. The $n^{\text {th }}$ row contains $n+1$ numbers, identified as $\mathrm{Pa}(n, k)$, where $0 \leq k \leq n$. For all $n$, define $\mathrm{Pa}(n, 0)=\operatorname{Pa}(n, n)=1$. Then for $n>1$ and $1 \leq k \leq n-1$, define $\mathrm{Pa}(n, k)=\mathrm{Pa}(n-1, k-1)+\mathrm{Pa}(n-1, k)$. It is convenient to define $\mathrm{Pa}(n, k)=0$ when $k<0$ or $k>n$. We write the nonzero values of $\mathrm{PT}$ in the familiar pyramid shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_b0415e12b85f62aa86deg-1.jpg?height=420&width=1201&top_left_y=1015&top_left_x=473)

As is well known, $\mathrm{Pa}(n, k)$ gives the number of ways of choosing a committee of $k$ people from a set of $n$ people, so a simple formula for $\mathrm{Pa}(n, k)$ is $\mathrm{Pa}(n, k)=\frac{n !}{k !(n-k) !}$. You may use this formula or the recursive definition above throughout this Power Question.

Clark's Triangle: If the left side of PT is replaced with consecutive multiples of 6 , starting with 0 , but the right entries (except the first) and the generating rule are left unchanged, the result is called Clark's Triangle. If the $k^{\text {th }}$ entry of the $n^{\text {th }}$ row is denoted by $\mathrm{Cl}(n, k)$, then the formal rule is:

$$
\begin{cases}\mathrm{Cl}(n, 0)=6 n & \text { for all } n \\ \mathrm{Cl}(n, n)=1 & \text { for } n \geq 1 \\ \mathrm{Cl}(n, k)=\mathrm{Cl}(n-1, k-1)+\mathrm{Cl}(n-1, k) & \text { for } n \geq 1 \text { and } 1 \leq k \leq n-1\end{cases}
$$

The first four rows of Clark's Triangle are given below.

![](https://cdn.mathpix.com/cropped/2023_12_21_c41919b703ea0b966244g-1.jpg?height=412&width=1152&top_left_y=1602&top_left_x=476)
Compute $\mathrm{Cl}(11,3)$.

Solution:
$\mathrm{Cl}(11,3)=2025$.

Final answer: 2025
Subfield: Combinatorics


Question: The arrangement of numbers known as Pascal's Triangle has fascinated mathematicians for centuries. In fact, about 700 years before Pascal, the Indian mathematician Halayudha wrote about it in his commentaries to a then-1000-year-old treatise on verse structure by the Indian poet and mathematician Pingala, who called it the Meruprastāra, or "Mountain of Gems". In this Power Question, we'll explore some properties of Pingala's/Pascal's Triangle ("PT") and its variants.

Unless otherwise specified, the only definition, notation, and formulas you may use for PT are the definition, notation, and formulas given below.

PT consists of an infinite number of rows, numbered from 0 onwards. The $n^{\text {th }}$ row contains $n+1$ numbers, identified as $\mathrm{Pa}(n, k)$, where $0 \leq k \leq n$. For all $n$, define $\mathrm{Pa}(n, 0)=\operatorname{Pa}(n, n)=1$. Then for $n>1$ and $1 \leq k \leq n-1$, define $\mathrm{Pa}(n, k)=\mathrm{Pa}(n-1, k-1)+\mathrm{Pa}(n-1, k)$. It is convenient to define $\mathrm{Pa}(n, k)=0$ when $k<0$ or $k>n$. We write the nonzero values of $\mathrm{PT}$ in the familiar pyramid shown below.

<img_3774>

As is well known, $\mathrm{Pa}(n, k)$ gives the number of ways of choosing a committee of $k$ people from a set of $n$ people, so a simple formula for $\mathrm{Pa}(n, k)$ is $\mathrm{Pa}(n, k)=\frac{n !}{k !(n-k) !}$. You may use this formula or the recursive definition above throughout this Power Question.

Clark's Triangle: If the left side of PT is replaced with consecutive multiples of 6 , starting with 0 , but the right entries (except the first) and the generating rule are left unchanged, the result is called Clark's Triangle. If the $k^{\text {th }}$ entry of the $n^{\text {th }}$ row is denoted by $\mathrm{Cl}(n, k)$, then the formal rule is:

$$
\begin{cases}\mathrm{Cl}(n, 0)=6 n & \text { for all } n \\ \mathrm{Cl}(n, n)=1 & \text { for } n \geq 1 \\ \mathrm{Cl}(n, k)=\mathrm{Cl}(n-1, k-1)+\mathrm{Cl}(n-1, k) & \text { for } n \geq 1 \text { and } 1 \leq k \leq n-1\end{cases}
$$

The first four rows of Clark's Triangle are given below.

<img_3289>
Compute $\mathrm{Cl}(11,3)$.

Solution:
$\mathrm{Cl}(11,3)=2025$.

Final answer: 2025
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_cadedb21e813fea89a84g-1.jpg?height=414&width=1174&top_left_y=1056&top_left_x=470)

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Compute the entries in the next two rows of Leibniz's Triangle.

Solution:
![](https://cdn.mathpix.com/cropped/2023_12_21_d6baba47070a814ce4efg-1.jpg?height=134&width=730&top_left_y=280&top_left_x=746)

Final answer: ![](https://cdn.mathpix.com/cropped/2023_12_21_d6baba47070a814ce4efg-1.jpg?height=134&width=730&top_left_y=280&top_left_x=746)
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_cadedb21e813fea89a84g-1.jpg?height=414&width=1174&top_left_y=1056&top_left_x=470)

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Compute Le(17,1).

Solution:
$\operatorname{Le}(17,1)=\operatorname{Le}(16,0)-\operatorname{Le}(17,0)=\frac{1}{17}-\frac{1}{18}=\frac{1}{306}$.

Final answer: $\frac{1}{306}$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

<img_3684>

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Compute Le(17,1).

Solution:
$\operatorname{Le}(17,1)=\operatorname{Le}(16,0)-\operatorname{Le}(17,0)=\frac{1}{17}-\frac{1}{18}=\frac{1}{306}$.

Final answer: $\frac{1}{306}$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_cadedb21e813fea89a84g-1.jpg?height=414&width=1174&top_left_y=1056&top_left_x=470)

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Compute $\operatorname{Le}(17,2)$.

Solution:
$\operatorname{Le}(17,2)=\operatorname{Le}(16,1)-\operatorname{Le}(17,1)=\operatorname{Le}(15,0)-\operatorname{Le}(16,0)-\operatorname{Le}(17,1)=\frac{1}{2448}$.

Final answer: $\frac{1}{2448}$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

<img_3684>

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Compute $\operatorname{Le}(17,2)$.

Solution:
$\operatorname{Le}(17,2)=\operatorname{Le}(16,1)-\operatorname{Le}(17,1)=\operatorname{Le}(15,0)-\operatorname{Le}(16,0)-\operatorname{Le}(17,1)=\frac{1}{2448}$.

Final answer: $\frac{1}{2448}$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_cadedb21e813fea89a84g-1.jpg?height=414&width=1174&top_left_y=1056&top_left_x=470)

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Find and justify a formula for $\operatorname{Le}(n, 1)$ in terms of $n$.

Solution:
$\operatorname{Le}(n, 1)=\operatorname{Le}(n-1,0)-\operatorname{Le}(n, 0)=\frac{1}{n}-\frac{1}{n+1}=\frac{1}{n(n+1)}$.

Final answer: $\operatorname{Le}(n, 1)=\operatorname{Le}(n-1,0)-\operatorname{Le}(n, 0)=\frac{1}{n}-\frac{1}{n+1}=\frac{1}{n(n+1)}$.
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

<img_3684>

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Compute $\sum_{n=1}^{2011} \operatorname{Le}(n, 1)$.

Solution:
Because $\operatorname{Le}(n, 1)=\frac{1}{n}-\frac{1}{n+1}$,

$$
\begin{aligned}
\sum_{i=1}^{2011} \operatorname{Le}(i, 1) & =\sum_{i=1}^{2011}\left(\frac{1}{n}-\frac{1}{n+1}\right) \\
& =\left(\frac{1}{1}-\frac{1}{2}\right)+\left(\frac{1}{2}-\frac{1}{3}\right)+\cdots+\left(\frac{1}{2010}-\frac{1}{2011}\right)+\left(\frac{1}{2011}-\frac{1}{2012}\right) \\
& =1-\frac{1}{2012} \\
& =\frac{2011}{2012} .
\end{aligned}
$$

Final answer: $\frac{2011}{2012}$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_cadedb21e813fea89a84g-1.jpg?height=414&width=1174&top_left_y=1056&top_left_x=470)

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Compute $\sum_{n=1}^{2011} \operatorname{Le}(n, 1)$.

Solution:
Because $\operatorname{Le}(n, 1)=\frac{1}{n}-\frac{1}{n+1}$,

$$
\begin{aligned}
\sum_{i=1}^{2011} \operatorname{Le}(i, 1) & =\sum_{i=1}^{2011}\left(\frac{1}{n}-\frac{1}{n+1}\right) \\
& =\left(\frac{1}{1}-\frac{1}{2}\right)+\left(\frac{1}{2}-\frac{1}{3}\right)+\cdots+\left(\frac{1}{2010}-\frac{1}{2011}\right)+\left(\frac{1}{2011}-\frac{1}{2012}\right) \\
& =1-\frac{1}{2012} \\
& =\frac{2011}{2012} .
\end{aligned}
$$

Final answer: $\frac{2011}{2012}$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_cadedb21e813fea89a84g-1.jpg?height=414&width=1174&top_left_y=1056&top_left_x=470)

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
Find and justify a formula for $\operatorname{Le}(n, 2)$ in terms of $n$.

Solution:
$\operatorname{Le}(n, 2)=\operatorname{Le}(n-1,1)-\operatorname{Le}(n, 1)=\frac{1}{n(n-1)}-\frac{1}{n(n+1)}=\frac{2}{(n-1)(n)(n+1)}$. Note that this result appears in the table as a unit fraction because at least one of the integers $n-1, n, n+1$ is even.

Final answer: $\operatorname{Le}(n, 2)=\operatorname{Le}(n-1,1)-\operatorname{Le}(n, 1)=\frac{1}{n(n-1)}-\frac{1}{n(n+1)}=\frac{2}{(n-1)(n)(n+1)}$. Note that this result appears in the table as a unit fraction because at least one of the integers $n-1, n, n+1$ is even.
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

<img_3684>

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
If $\sum_{i=1}^{\infty} \operatorname{Le}(i, 1)=\operatorname{Le}(n, k)$, determine the values of $n$ and $k$.

Solution:
Extending the result of $8 \mathrm{~b}$ gives

$$
\sum_{i=1}^{n} \operatorname{Le}(i, 1)=\frac{1}{1}-\frac{1}{n}
$$

so as $n \rightarrow \infty, \sum_{i=1}^{n} \operatorname{Le}(i, 1) \rightarrow 1$. This value appears as $\operatorname{Le}(0,0)$, so $n=k=0$.

Final answer: $0,0$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_cadedb21e813fea89a84g-1.jpg?height=414&width=1174&top_left_y=1056&top_left_x=470)

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
If $\sum_{i=1}^{\infty} \operatorname{Le}(i, 1)=\operatorname{Le}(n, k)$, determine the values of $n$ and $k$.

Solution:
Extending the result of $8 \mathrm{~b}$ gives

$$
\sum_{i=1}^{n} \operatorname{Le}(i, 1)=\frac{1}{1}-\frac{1}{n}
$$

so as $n \rightarrow \infty, \sum_{i=1}^{n} \operatorname{Le}(i, 1) \rightarrow 1$. This value appears as $\operatorname{Le}(0,0)$, so $n=k=0$.

Final answer: $0,0$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

![](https://cdn.mathpix.com/cropped/2023_12_21_cadedb21e813fea89a84g-1.jpg?height=414&width=1174&top_left_y=1056&top_left_x=470)

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
If $\sum_{i=m}^{\infty} \operatorname{Le}(i, m)=\operatorname{Le}(n, k)$, compute expressions for $n$ and $k$ in terms of $m$.

Solution:
$n=k=m-1$.

Final answer: $m-1,m-1$
Subfield: Combinatorics


Question: Leibniz's Harmonic Triangle: Consider the triangle formed by the rule

$$
\begin{cases}\operatorname{Le}(n, 0)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, n)=\frac{1}{n+1} & \text { for all } n \\ \operatorname{Le}(n, k)=\operatorname{Le}(n+1, k)+\operatorname{Le}(n+1, k+1) & \text { for all } n \text { and } 0 \leq k \leq n\end{cases}
$$

This triangle, discovered first by Leibniz, consists of reciprocals of integers as shown below.

<img_3684>

For this contest, you may assume that $\operatorname{Le}(n, k)>0$ whenever $0 \leq k \leq n$, and that $\operatorname{Le}(n, k)$ is undefined if $k<0$ or $k>n$.
If $\sum_{i=m}^{\infty} \operatorname{Le}(i, m)=\operatorname{Le}(n, k)$, compute expressions for $n$ and $k$ in terms of $m$.

Solution:
$n=k=m-1$.

Final answer: $m-1,m-1$