benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / Suppose we have four integers, no two of which are congruent pmod 6. Let N be the product of the four integers. If N is not a multiple of 6, then what is the remainder of N when N …

Problem

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

problem

Suppose we have four integers, no two of which are congruent $\pmod 6$. Let NN be the product of the four integers. If NN is not a multiple of 66, then what is the remainder of NN when NN is divided by 66?
Plain-text mathematical notation (without MathML)
Suppose we have four integers, no two of which are congruent $\pmod 6$. Let N be the product of the four integers.

If N is not a multiple of 6, then what is the remainder of N when N is divided by 6?
Original LaTeX notation
Suppose we have four integers, no two of which are congruent $\pmod 6$. Let $N$ be the product of the four integers.

If $N$ is not a multiple of $6$, then what is the remainder of $N$ when $N$ is divided by $6$?

level

Level 3

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

task_id
1f93ec4f-987a-5c4a-a2ec-2b1a482e2695
task_key
number~5ftheory--test--1f93ec4f-987a-5c4a-a2ec-2b1a482e2695
task_revision_id
1
config / split
number_theory / test

Official source

initial import