Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Suppose that and are integers with1k<n . Prove the hexagon identity(n1k1)(nk+1)(n+1k)=(n1k)(nk1)(n+1k+1) which relates terms in Pascal's triangle that form a hexagon.

Short Answer

Expert verified

The hexagon identityn1k1nk+1n+1k=n1knk1n+1k+1 which relates terms in Pascal’s triangle that form a hexagon is proved.

Step by step solution

01

The hexagonal property of Pascal’s triangle

Any hexagon in Pascal's triangle, whose vertices arebinomial coefficients surrounding any entry, has the property that:

  • the product of non-adjacent vertices is constant.
  • the greatest common divisor of non-adjacent vertices is constant.
02

Prove the hexagon identity with related terms in Pascal’s triangle

Let n be a positive integer and k an integer with0kn .

n1k1nk+1n+1k=(n1)!(k1)!(n1(k1))!n!(k+1)!(n(k+1))!(n+1)!k!(n+1k)!=(n1)!(k1)!(nk)!n!(k+1)!(nk1))!(n+1)!k!(nk+1)!=(n1)!(k1)!(nk)!n!(k+1)!((n1)k)!(n+1)!k!(n(k1))!

(Reorder factors k!,(k1)!and(k+1)!indenominators)

n1k1nk+1n+1k=(n1)!k!(nk)!n!(k1)!((n1)k)!(n+1)!(k+1)!(n(k1))!

(Reorder factors (nk)!,((n1)k)!and(n(k1))!denominators)

n1k1nk+1n+1k=(n1)!k!((n1)k)!n!(k1)!(n(k1))!(n+1)!(k+1)!(nk)!=(n1)!k!((n1)k)!n!(k1)!(n(k1))!(n+1)!(k+1)!((n+1)(k+1))!=n1knk1n+1k+1

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free