benchmarks.wiki / Public workspace

MATH / Suppose a and b are positive integers, neither of which is a multiple of 3. Find the least possible remainder when a²+b² is divided by 3.

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Suppose aa and bb are positive integers, neither of which is a multiple of 3. Find the least possible remainder when a2+b2a^2 + b^2 is divided by 3.
Plain-text mathematical notation (without MathML)
Suppose a and b are positive integers, neither of which is a multiple of 3.  Find the least possible remainder when a²+b² is divided by 3.
Original LaTeX notation
Suppose $a$ and $b$ are positive integers, neither of which is a multiple of 3.  Find the least possible remainder when $a^2 + b^2$ is divided by 3.

level

Level 2

type

Number Theory

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import