18 problems
Non-square conjecture. For every , both and are non-square in .
Second-iterate irreducibility conjecture. If is irreducible over , then is stable over .
Stable-factorization conjecture. The polynomial is eventually stable over with constant , and exactly one of the following cases holds:
Let be a prime with , and write with . Odd-multiple valuation conjecture. … Equivalently, among multiples of , … for …
Let be an odd prime and define … with . The mod-4 valuation conjecture. For , … and for , … These formulas are s…
Lucas congruence for Gaussian binomial coefficients. For positive integers for which these coefficients are defined,
Conjectural coefficient pattern. If , then
Wolstenholme's higher-power congruences. For every such and ,
Let be an even Gaussian integer, let denote its norm, and let denote its argument. Gaussian Goldbach conjecture with angular restrictions. Every even Gaussian…
Let be a primitive Gaussian line, and let denote the indexed Gaussian integers on . For , write for its Gaussian norm. Weak…
Let be a primitive Gaussian line, and let denote the indexed Gaussian integers on . For , define … Here is the Gaussian norm. Stro…
Bounded odd Gaussian-prime representation conjecture. There are constants and such that, for every with…
Let be a self-converse mixed graph, let be its walk-matrix, let be the associated set of Gaussian rational unitary matrices, and l…
Let and be nonzero ideals chosen independently and uniformly at random from the set of ideals in with norm at most . Write…
Bradford–Ionascu conjecture. Such a decomposition exists with such that the real and imaginary parts of each of , , and are either both nonnegativ…
Gaussian Erdős–Moser conjecture. The equation above has only the solution :
Asymptotic cardinality conjecture. The minimal cardinality satisfies