• CTcong.txt

  • Referenced in 5 articles [sw30553]
  • Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences. Many combinatorial ... variable (x) with integer coefficients. Denoting such a sequence by (a_k), we obtain ... general formula that determines the congruence class, modulo (p), of the indefinite sum (sumlimits ... coefficients. This enables us (or rather, our computers) to automatically discover and prove congruence theorems...
  • IntegerSequences

  • Referenced in 4 articles [sw25549]
  • function enumerating binomial coefficients by their p-adic valuations, and proving congruences for combinatorial sequences...
  • eta-quotients

  • Referenced in 1 article [sw38678]
  • Congruences satisfied by eta-quotients. The values of the partition function, and more generally ... Fourier coefficients of many modular forms, are known to satisfy certain congruences. Results given ... general Fourier coefficients state the existence of infinitely many families of congruences. In this article...
  • MHS

  • Referenced in 4 articles [sw31594]
  • finitely many inequalities between polynomials with rational coefficients. Although periods are typically transcendental numbers, there ... periods called multiple zeta values and congruences for rational numbers modulo prime powers (called supercongruences...
  • BARON

  • Referenced in 354 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • Coq

  • Referenced in 1890 articles [sw00161]
  • Coq is a formal proof management system. It...
  • FLINT

  • Referenced in 58 articles [sw00297]
  • Fast library for number theory: an introduction. We...
  • GAP

  • Referenced in 3189 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • GELDA

  • Referenced in 33 articles [sw00331]
  • GELDA is a Fortran77 sofware package for the...
  • LAPACK

  • Referenced in 1702 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • Macaulay2

  • Referenced in 1923 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...
  • Magma

  • Referenced in 3315 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 5373 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 6355 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 13544 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • Normaliz

  • Referenced in 172 articles [sw00630]
  • Normaliz is a tool for computations in affine...
  • NTL

  • Referenced in 220 articles [sw00638]
  • NTL is a high-performance, portable C++ library...
  • PARI/GP

  • Referenced in 636 articles [sw00680]
  • PARI/GP is a widely used Computer Algebra System...
  • polymake

  • Referenced in 316 articles [sw00724]
  • polymake is open source software for research in...
  • SageMath

  • Referenced in 1994 articles [sw00825]
  • Sage (SageMath) is free, open-source math software...