MathDB
partitioning 1 to p-1 into several a+b=c (mod p)

Source: own

April 21, 2024
number theory

Problem Statement

Given a prime number pp, a set is said to be pp-good if the set contains exactly three elements a,b,ca, b, c and a+b≡c(modp)a + b \equiv c \pmod{p}. Find all prime number pp such that {1,2,⋯ ,p−1}\{ 1, 2, \cdots, p-1 \} can be partitioned into several pp-good sets.
Proposed by capoouo
Back to ProblemsView on AoPS