Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
3 problems
showing 1–3
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
For odd k with gcd(n,k) = gcd(n+1,k) = 1, is N_k(n) ≡ ⌊ (k+1)/4 ⌋ pmod 2, where N_k(n) counts pairs 1 ≤ b_i ≤ (k-1)/2 with b_1 + b_2 ≥ (k+1)/2 and b_2 ≡ n b_1 pmod k? Conjectured by Chen and Gendron; its proof removes a conditional step in…