benchmarks.wiki / Public workspace

MATH / Given that k is a positive integer less than 6, how many values can k take on such that 3x equiv k pmod{6} has no solutions in x?

Problem

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

problem

Given that kk is a positive integer less than 6, how many values can kk take on such that $3x \equiv k \pmod{6}$ has no solutions in xx?
Plain-text mathematical notation (without MathML)
Given that k is a positive integer less than 6, how many values can k take on such that $3x \equiv k \pmod{6}$ has no solutions in x?
Original LaTeX notation
Given that $k$ is a positive integer less than 6, how many values can $k$ take on such that $3x \equiv k \pmod{6}$ has no solutions in $x$?

level

Level 4

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