arXiv (All)
open access
A problem on the largest divisor $d$ of $N$ with $d\leq \sqrt{N}$
For a given number $N$, we consider the problem of computing two integers $1\leq r,f < N$ such that the set $$\mathcal{X}(N,r,f) = \{(a+b)-(f+\frac{Nr+1}{f}): ab=Nr\}$$ consists only of positive integers. Computing a solution to the problem is equivalent to finding a pair $(r,f)$ satisfying
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
- Extremal problems in number theory#490212
- Diophantine approximation with primes in an arithmetic progression#996808
- Primes with Restricted-Digit Differences#987858
- Irreducible $\mathbb Z_+$-modules over $\mathbb Z[\sqrt[m]{d_1},\sqrt[m]{d_2},\ldots, \sqrt[m]{d_r}]$#1132105
- Notes on Mitsui's Prime Number Theorem with Siegel zeros#984784
Record · ID 1011200
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