Algorithms, Blockchain and Cloud

Proof without Words: 1 + 2 + 3 + .. (n – 1) = Cn2

ACMer

Google ‘Proof without Words‘ you will find some interesting figures that are easy to understand. For example, the following figure is a vivid proof of the math formula

Hint: Choosing any two circles result in the number of yellow circles above.

–EOF (The Ultimate Computing & Technology Blog) —

208 words
Last Post: Codeforces: B. T-primes
Next Post: Simple Calculation without Integration

The Permanent URL is: Proof without Words: 1 + 2 + 3 + .. (n – 1) = Cn2 (AMP Version)

Related posts:

  1. Characteristic Attributes Essential for Successful Software Engineers Passion for Learning Technology evolves, and as a software engineer, you would need a passion...
  2. Teaching Kids Programming – Most Common SQL keywords (Select, Update, Insert, Delete) Teaching Kids Programming: Videos on Data Structures and Algorithms Here are a few SQL keywords...
  3. Teaching Kids Programming – Finding 3-Digit Even Numbers (Breadth First Search Algorithm) Teaching Kids Programming: Videos on Data Structures and Algorithms You are given an integer array...
  4. Teaching Kids Programming – Depth First Search Algorithm to Find Bottom Left Tree Value Teaching Kids Programming: Videos on Data Structures and Algorithms Given the root of a binary...
  5. How to Delete Nodes from Binary Tree and Make a Forest? Given the root of a binary tree, each node in the tree has a distinct...
  6. Teaching Kids Programming – Minimum Distance of Two Words in a Sentence/String Teaching Kids Programming: Videos on Data Structures and Algorithms Given the strings text, word0, and...
  7. Using Reduce to Count the Array in Javascript Let’s say, we have an array in Javascript, and we want to group the elements,...
  8. Teaching Kids Programming – From Linear Search to Binary Search Algorithm Teaching Kids Programming: Videos on Data Structures and Algorithms Linear Search Algorithm to Find Square...
Exit mobile version