benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / Given that m and n are positive integers such that mequiv 6pmod 9 and nequiv 0pmod 9, what is the largest integer that mn is necessarily divisible by?

Problem

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

problem

Given that mm and nn are positive integers such that $m\equiv 6\pmod 9$ and $n\equiv 0\pmod 9$, what is the largest integer that mnmn is necessarily divisible by?
Plain-text mathematical notation (without MathML)
Given that m and n are positive integers such that $m\equiv 6\pmod 9$ and $n\equiv 0\pmod 9$, what is the largest integer that mn is necessarily divisible by?
Original LaTeX notation
Given that $m$ and $n$ are positive integers such that $m\equiv 6\pmod 9$ and $n\equiv 0\pmod 9$, what is the largest integer that $mn$ is necessarily divisible by?

level

Level 5

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
2dd77857-aaaf-5875-a052-d8029b876b44
task_key
number~5ftheory--test--2dd77857-aaaf-5875-a052-d8029b876b44
task_revision_id
1
config / split
number_theory / test

Official source

initial import