The three-prime floor-function set formula
Statement
Let denote the number of primes in the set . Suppose that , where are primes satisfying . The three-prime floor-function set formula. Then
This statement is presented as a generalisation suggested by a limited computational investigation; unlike the preceding prime and semiprime cases, no proof or resolution is supplied in the source.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.