Abstract

This work deals with the plane sections lying over the Pascal pyramid. Any plane section can be defined using two main diagonals with parameters (q1,r1) and (q2,r2). We study the main case r1=r2=1, which corresponds to plane sections crossing all parallel planes to the x axis and intersecting with the integer coordinates of the pyramid. We establish the recurrence relation satisfied by the sequence of numbers counting the sum of elements lying over each plane section.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.