MathDB
Problems
Contests
National and Regional Contests
Taiwan Contests
TST Round 1
2024 Taiwan TST Round 1
N
N
Part of
2024 Taiwan TST Round 1
Problems
(1)
partitioning 1 to p-1 into several a+b=c (mod p)
Source: own
4/21/2024
Given a prime number
p
p
p
, a set is said to be
p
p
p
-good if the set contains exactly three elements
a
,
b
,
c
a, b, c
a
,
b
,
c
and
a
+
b
≡
c
(
m
o
d
p
)
a + b \equiv c \pmod{p}
a
+
b
≡
c
(
mod
p
)
. Find all prime number
p
p
p
such that
{
1
,
2
,
⋯
,
p
−
1
}
\{ 1, 2, \cdots, p-1 \}
{
1
,
2
,
⋯
,
p
−
1
}
can be partitioned into several
p
p
p
-good sets.Proposed by capoouo
number theory