3 problems

Let … where $\{x\}=x-\left\lfloor x\right\rfloor$. For a rational number $x\geq 2$, define its order under $\mathcal{T}$ to be the least non-negative integer $n$ such that…

Primality conjecture for the almost-prime Mill function. It is conjectured that $f(n)$ is prime for all $n\geq 1$. The paper proves that $f(n)$ has at most two prime factors counti…

Prime-representing function conjecture. There is a constant $A$, possibly near $1.1966746500705764022$, such that $f(n)$ is prime for every integer $n\geq 1$.