eScholarship
metadata only
All four Liouville sign patterns occur in the binary decompositions of every integer N ≥ 11
Let λ be the Liouville function. We prove that for every integer N ≥ 2 outside the set E = {2,3,4,5,6,9,10} and every (s,t) in {±1}^2 there are positive integers a, b with a+b = N, λ(a) = s and λ(b) = t, and that each N in E misses at least one of the four patterns. For this qualitative existence st
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
- On the factorization of squarefree integers#490249
- Resultant of an equivariant polynomial system with respect to the reflection group $G(r,n)$#1064430
- Finite graphs and configurations of points#984065
- Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes#1034222
- Vô Conjecture 10 (VC10)#732262
Record · ID 1079061
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