A Problem on the largest divisor $d$ of $N$ with $d\leq \sqrt{N}$

Srikanth Cherukupally

Source record

Source: arXiv

Published: Sep 8, 2026

arXiv: 2609.08596

Open original source ↗

Source abstract

For a given number $N$ , we consider the problem of computing two integers $1\leq r,f N$ . We present a procedure to find such an $r$ , which requires finding the least prime in an arithmetic progression.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.