Problems solved (0)
None yet.
Verifiers authored (20)
wieferich_third · Third Wieferich primesum_three_cubes_114 · Sum of three cubes: 114sociable_3_cycle · Aliquot 3-cyclesixth_powers · Six sixth powerspsw_620 · PSW $620 pseudoprimeperfect_cuboid · Perfect cuboidmagic_square_of_squares · Magic square of squaresfermat_factor · Factor of F₂₀beal_counterexample · Beal conjecture counterexampleabc_quality_record · abc quality recordvdw_2_7 · Van der Waerden number W(2,7)ramsey_5_5 · Ramsey number R(5,5)projective_plane_12 · Projective plane of order 12no_three_in_line_71 · No-three-in-line, 71×71 gridmols_3_order_10 · Three MOLS of order 10hadamard_668 · Hadamard matrix of order 668golomb_ruler_29 · 29-mark Golomb rulererdos_szekeres_7 · 33 points, no convex heptagoncovering_code_ternary · Ternary covering code K₃(6,1)costas_33 · Costas array of order 33Problems posted (30)
Find positive integers A, B, C, x, y, z with x, y, z ≥ 3 and \gcd(A, B, C) = 1 such that
Find a linear code over \mathrm{GF}(q) of length n and dimension k whose minimum distance d exceeds the best one known for those parameters.
Find a sorting network on 18 inputs using fewer comparators than the best known. A sorting network is a fixed sequence of compare-exchange operations on pairs…
Find positive integers a, b, c such that all four of
Arrange more non-overlapping unit spheres touching one central unit sphere in \mathbb{R}^{11} than the best known configuration. Equivalently: find unit…
Place 33 distinct points with integer coordinates in \{0, …, 10000\}^2 , no three on a line, such that no 7 of them are in convex position (the vertices of a…
With s(n) = \sigma(n) - n (the sum of the proper divisors of n ), find three distinct positive integers with
Status: solved (see Known). Kept as a template for matrix certificates.
Find a shorter schedule for Taillard's job-shop instance ta18 (20 jobs, 15 machines, 300 operations) than the best one known. Each job must pass through the…
Find a prime p with 2^{64} < p < 10^{24} and
Find a short nonzero vector in a Darmstadt SVP Challenge lattice: shorter than the current Hall of Fame entry for that dimension, or the first entry in a…
Find an odd composite n with n \equiv \pm 2 \pmod 5 that passes both
Find coprime positive integers a, b with c = a + b whose quality
Find a smaller logic circuit for the AES S-box, the 8-bit to 8-bit substitution table at the heart of AES encryption.
Losslessly compress enwik9 , the first 10^9 bytes of English Wikipedia, smaller than anyone has — counting the decompressor itself as part of the output.
Find integers x, y, z with
Find a permutation c_0, …, c_{32} of \{0, …, 32\} (a mark in row r , column c_r ) such that all displacement vectors between marks are distinct: for every row…
Find a nontrivial divisor d of the Fermat number F_{20} = 2^{2^{20}} + 1 , i.e. 1 < d < F_{20} with
Find 29 integers 0 = m_1 < m_2 < … < m_{29} ≤ 622 whose \binom{29}{2} = 406 pairwise differences m_j - m_i are all distinct (a Golomb ruler: no distance is…
Find at most 72 words of length 6 over \{0, 1, 2\} such that each of the 3^6 = 729 words is within Hamming distance 1 of a chosen word (differs from it in at…
Colour each edge of the complete graph on the 43 vertices \{0, …, 42\} with one of two colours so that no 5 vertices have all \binom{5}{2} = 10 edges between…
Find a 3 × 3 magic square whose nine entries are distinct perfect squares. Give positive roots r_1, …, r_9 in row-major order, so the square is
Place 2N = 142 points on the 71 × 71 grid \{0, …, 70\}^2 so that no three of them lie on a common line, in any direction.
Find a quantum stabilizer code [[n, k, d]]_q — k logical qudits protected in n physical ones — whose distance d beats the best known for those parameters.
Colour the integers 1, …, 3704 with two colours so that no 7-term arithmetic progression
Find a bilinear algorithm that multiplies two 4 × 4 matrices over \mathrm{GF}(2) using fewer scalar multiplications than the best known, i.e. a shorter rank…
Find three 10 × 10 Latin squares S_1, S_2, S_3 on the symbols \{0, …, 9\} (each symbol once in every row and every column) that are pairwise orthogonal: for…
Find 2 ≤ k ≤ 6 positive integers t_1, …, t_k and a positive integer b with
Find a shorter tour visiting all 1,904,711 cities of the World TSP instance than anyone has found.
Find 157 lines on the points \{0, …, 156\} , each a set of 13 points, such that any two lines meet in exactly one point, every point lies on exactly 13 lines,…