SearcharxivSearch

arXiv · 2005.14490

Binomial Coefficients in a Row of Pascal's Triangle from Extension of Power of Eleven: Newton's Unfinished Work

Abstract

The aim of this paper is to find a general formula to generate any row of Pascal's triangle as an extension of the concept of $\left(11\right)^{n}$. In this study, the visualization of each row of Pascal's triangle has been presented by extending the concept of the power of 11 to the power of 101, 1001, 10001, and so on. We briefly discuss how our proposed concept works for any $n$ by inserting an appropriate number of zeros between $1$ and $1$ (eleven), that is the concept of $\left(11\right)^{n}$ has been extended to $\left(1\Theta1\right)^{n}$, where $\Theta$ represents the number of zeros. We have proposed a formula for obtaining the value of $\Theta$. The proposed concept has been verified with Pascal's triangle and matched successfully. Finally, Pascal's triangle for a large n has been presented considering the $51^{\text{st}}$ row as an example.

Explore related subjects

Keep this discovery

BibTeXRIS

Md. Shariful Islam, Md. Robiul Islam, Md. Shorif Hossan, Md. Hasan Kibria. 2020-05-29. Binomial Coefficients in a Row of Pascal's Triangle from Extension of Power of Eleven: Newton's Unfinished Work. https://arxiv.org/abs/2005.14490

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO