Pascal's triangle: Difference between revisions

Content deleted Content added

Revision as of 02:14, 13 June 2025 edit Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,526 edits Altered journal. \| Use this tool. Report bugs. \| #UCB_Gadget ← Previous edit		Latest revision as of 16:36, 29 July 2025 edit undo Twoxili (talk \| contribs) Extended confirmed users 843 edits →To arbitrary bases: refined congruence phrasing
(3 intermediate revisions by 3 users not shown)
Line 458: \| doi = 10.5802/ambp.211 \| url = https://ambp.centre-mersenne.org/item/10.5802/ambp.211.pdf }}.</ref> as demonstrated [[#Binomial expansions\|above]]. Thus, when the entries of the row are concatenated and read in radix <math>a</math> they form the numerical equivalent of <math>(a + 1)^{n} = 11^{n}_{a}</math>. If <math>c = a + 1</math> for <math>c < 0</math>, then the theorem [[Negative base\|holds]] for <math>a =\bmod 2c</math>, with <math>a</math> congruent to <math>\{c - 1, -(c + 1)\} ~~\;\mathrm{mod}\; 2c~~</math>, and with odd values of <math>n</math> [[Negative number#Multiplication\|yielding]] negative row products.<ref>{{cite book \| display-authors = etal \| last = Hilton \| first = P.