arXiv (All)
open access
A quadratic-residue dichotomy for two partition functions modulo 3
Let $f_{0,1,4}(n)$ denote the number of partitions of $n$ into parts congruent to 0, 1 or 4 modulo 5 with each part used at most twice, and let $f_{0,2,3}(n)$ be defined analogously for parts congruent to 0, 2 or 3 modulo 5. We prove that for every prime $p \equiv 3 \pmod 4$ there are explicit non-n
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A New Grounded Partition Identity of Type $D_4^{(3)}$#189217
- Approximating Partition in Deterministic Near-Linear Time#1062757
- Counting Type I and Type II solutions of the Erdos-Straus equation: concentration, local obstructions, and a pointwise comparison#1083221
- Selberg sieve weights and sign changes of Kloosterman sums. I. Uniform asymptotics for shifted weights#1050431
- Vô Conjecture 15 series 9(VC15S9)#728667
Record · ID 1037023
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive