13 problems
Hong–Yang conjecture. The integer
A distinct covering system is a covering system whose moduli are distinct integers greater than . Let , let , , and be positive integers, and let denote t…
Let be the largest integer for which there exist integers … with no of the forming an LCM--tuple, where an LCM--tuple consists of distinct integers who…
Erdős's stronger conjecture. There exist integers and with such that
Let , let … and let … A prime is said to divide exactly once when its exponent in the prime factorization of is one. Sah's conjecture. The size…
Let be a prime power, and let be a fixed irreducible polynomial with -degree . Define … Let …
The conjecture for . One should have
Let and define … The notation denotes the least common multiple of . Let be a polynomial in of degree , and le…
Shevelev–Moses conjecture. The sequence is given by
Farhi's conjecture. The exponent in the known lower bound should be replaceable by , yielding the optimal exponent obtainable in such a lower bound. This conjecture was co…
Let be irreducible over of degree , and define … where is the product of the distinct primes dividing . Radical LC…
Let be an irreducible polynomial of degree , with , and let denote the least common multiple of the values of up to…