Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On binomial coefficients modulo squares of primes

From MaRDI portal
Publication:5383268
Jump to:navigation, search

zbMath1448.11048arXiv1712.02095MaRDI QIDQ5383268

Darij Grinberg

Publication date: 21 June 2019

Full work available at URL: https://arxiv.org/abs/1712.02095


zbMATH Keywords

congruencesbinomial coefficients


Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65) Congruences; primitive roots; residue systems (11A07)


Related Items

Uniformizer of the false Tate curve extension of \(\mathbb{Q}_p\) ⋮ On binomial coefficients modulo squares of primes


Uses Software

  • GitHub


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Two triple binomial sum supercongruences
  • Some binomial coefficient congruences
  • \(t\)-unique reductions for Mészáros's subdivision algebra
  • ON SOME NEW CONGRUENCES FOR BINOMIAL COEFFICIENTS
  • Proofs of Power Sum and Binomial Coefficient Congruences Via Pascal’s Identity
  • An Alternate Approach to Alternating Sums: A Method to DIE for
  • Using the “Freshman′s Dream” to Prove Combinatorial Congruences
  • Applications of a Simple Counting Technique
  • On binomial coefficients modulo squares of primes
  • Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems


This page was built for publication: On binomial coefficients modulo squares of primes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5383268&oldid=20106025"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 9 February 2024, at 01:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki