The Sid (n) Function
A new function was discovered by the researcher which is sid (n) = no of composite numbers between n and 2n multiplied by number of divisors of n and the divided by the number of prime numbers between n and 3n .
Sid(4) = 1
FORMULA
References
NA
Progress summary
Refreshed
Open
No one appears to have made public progress on this newly stated function.
No public discussion or published progress was found for the stated function or its claimed value at four.
Current status (as of November 2026): the problem appears open, with no recorded public activity.
Solutions 0
No solutions have been posted yet.