PhilArchive
open access
Vô Conjecture 10 (VC10)
In this paper, we present and describe Vô Conjecture 10 (VC10), a statement concerning the existence of pairs of distinct odd integers a,b>2 with disjoint sets of prime factors, such that the number of distinct prime divisors appearing in a, b, and a^k+b^k equals a prescribed integer n>3. This conjecture extends investigations into the distribution of prime factors in power sums and related expressions, and connects to classical problems in number theory.
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
- Reduction of integer tiles via CRT and base-p digits#1083507
- Extremal problems in number theory#490212
- Surjectivity of the Enots Wolley Sequence#1034784
- All four Liouville sign patterns occur in the binary decompositions of every integer N ≥ 11#1079061
- The $\mathbb{Z}$-Divisor Graph on $\mathbb{Q} \cap [1,7]$ is Planar and 3-Colorable#1051128
Record · ID 732262
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