Chapter 4: Problem 2
Prove that the sum of two consecutive triangular numbers is a perfect square.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 4: Problem 2
Prove that the sum of two consecutive triangular numbers is a perfect square.
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(A, A_{1}, A_{2}, \ldots, A_{n}, B_{1}, B_{2}, \ldots, B_{n}\) be any sets, and \(p_{1}, p_{2}, \ldots, p_{n}, q, q_{1}\) \(q_{2}, \ldots, q_{n}\) be any propositions. Using induction prove each. $$A \bigcap_{i=1}^{n}\left(\cup B_{i}\right)=\bigcup_{i=1}^{n}\left(A \cap B_{i}\right)$$
Let \(a\) and \(b\) be any two positive integers with \(a \geq b\). Using the sequence of equations in the euclidean algorithm prove that \(\operatorname{gcd}\\{a, b\\}=\operatorname{gcd}\left\\{r_{n-1}, r_{n}\right\\}, n \geq 1\).
(Twelve Days of Christmas) Suppose you sent your love 1 gift on the first day of Christmas, \(1+2\) gifts on the second day, \(1+2+3\) gifts on the third day and so on. $$ \sum_{i=1}^{n}(2 i-1)=n^{2} $$
Find the number of times the statement \(x \leftarrow x+1\) is executed by each loop. $$ \begin{array}{c}{\text { for } 1=1 \text { to } n \text { do }} \\ {\text { for } j=1 \text { to } 1 \text { do }} \\ {x \leftarrow x+1}\end{array} $$
Using the big-oh notation, estimate the growth of each function. $$f(n)=3 \lg n+2$$
What do you think about this solution?
We value your feedback to improve our textbook solutions.