Question 1
SEAMO self-study edition 2027; not an official 2027 paper. Original source years are retained. 25 questions, 90 minutes; Q1–10: 3 points, Q11–20: 4 points, Q21–25: 6 points, total 100. Original response types and all subparts are preserved. Verified is an editorial convention; source defects, necessary assumptions and unresolved mathematical uncertainty are disclosed.
Let $S$ be the smallest positive multiple of 15 that comprises exactly $3k$ digits, with $k$ zeros, $k$ threes and $k$ eights. Find the remainder when $S$ is divided by 11.
Let $S$ be the smallest positive multiple of 15 that comprises exactly $3k$ digits, with $k$ zeros, $k$ threes and $k$ eights. Find the remainder when $S$ is divided by 11.