ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Under the restricted factorization described in the source, assign a fractional order ord⁡(p)\operatorname{ord}(p) or ord⁡(l)\operatorname{ord}(l) recursively to primes pp and lucky numbers ll: lucky primes have order 11, products of powers of lucky primes have prime order 1/21/2, and products of primes have lucky order 1/21/2; in general, the order is determined by the smallest fractional order of the relevant factors as specified by the recursive definition. Fractional-order infinitude conjecture. For every fixed positive integer nn, there are infinitely many prime numbers or lucky numbers of order 1/n1/n. This generalizes the conjecture that there are infinitely many lucky primes, but the source gives no resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.