Timeline for Binomial coefficient congruence modulo $p^n$
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2022 at 17:50 | comment | added | Michael Zieve | Could you give more details about what book has this reference? I don't recall ever believing the stated congruence, but if I really said it was true in something I published then I'd like to write an erratum. (I think I'm the only mathematician named "Zieve", so this appears to refer to me.) | |
| Oct 27, 2022 at 14:20 | vote | accept | Vlad Matei | ||
| Oct 26, 2022 at 15:32 | answer | added | Ira Gessel | timeline score: 5 | |
| Oct 26, 2022 at 15:23 | answer | added | Ofir Gorodetsky | timeline score: 7 | |
| Oct 26, 2022 at 14:56 | comment | added | Vlad Matei | Yes sorry! $p$ should be greater than or equal to $5$ | |
| Oct 26, 2022 at 14:52 | comment | added | David E Speyer | For the standard congruence $\binom{2p}{p} \cong 2 \bmod p^3$, you have to impose $p \geq 5$. I would imagine there would be similar conditions, and perhaps more of them, needed for your more general statement. | |
| Oct 26, 2022 at 14:51 | comment | added | Vlad Matei | Yes! But I do not see how it follows from that or maybe I am doing some computations wrong | |
| Oct 26, 2022 at 14:40 | comment | added | Sam Hopkins | "I am also aware of the various generalizations of Lucas's theorem...": I suppose in particular you know about Granville's version for binomials mod prime powers? | |
| Oct 26, 2022 at 14:16 | history | asked | Vlad Matei | CC BY-SA 4.0 |