Content deleted Content added
→To arbitrary bases: clarified modular congruence notation |
→To arbitrary bases: refined congruence phrasing |
||
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>,
| display-authors = etal
| last = Hilton | first = P.
| |||