The number of solutions to ax + by + cz = n and its relation to quadratic residues
zbMATH Open1476.11067MaRDI QIDQ5113818FDOQ5113818
Authors: Damanvir Singh Binner
Publication date: 17 June 2020
Full work available at URL: https://cs.uwaterloo.ca/journals/JIS/VOL23/Binner/binner4.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
generating functionFrobenius numberroots of unityLegendre symbolpartial fractionfloor functionlinear Diophantine equationquadratic reciprocityEisenstein's lemmaFrobenius coin problem
Exact enumeration problems, generating functions (05A15) Power residues, reciprocity (11A15) Counting solutions of Diophantine equations (11D45) The Frobenius problem (11D07) Linear Diophantine equations (11D04)
Cites Work
Cited In (9)
- On the number of solutions of nonhomogeneous equations
- On the solutions of three-variable Frobenius-related problems using order reduction approach
- Counting solutions of quadratic congruences in several variables revisited
- Counting certain quadratic partitions of zero modulo a prime number
- \(p\)-numerical semigroups with \(p\)-symmetric properties
- The Frobenius number associated with the number of representations for sequences of repunits
- On the determination of p-Frobenius and related numbers using the p-Apéry set
- Generalization of a Result of Sylvester Regarding the Frobenius Coin Problem and an Elementary Proof of Eisenstein's Lemma for Jacobi Symbols
- On conjectures concerning the smallest part and missing parts of integer partitions
This page was built for publication: The number of solutions to \(ax + by + cz = n\) and its relation to quadratic residues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113818)