benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For how many pairs (m,n) with m and n integers satisfying 1≤m≤100 and 101≤n≤205 is 3^(m)+7^(n) divisible by 10?

Problem

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

problem

For how many pairs (m,n)(m, n) with mm and nn integers satisfying 1≤m≤1001 \leq m \leq 100 and 101≤n≤205101 \leq n \leq 205 is 3m+7n3^{m}+7^{n} divisible by 10?
Plain-text mathematical notation (without MathML)
For how many pairs (m,n) with m and n integers satisfying 1≤m≤100 and 101≤n≤205 is 3^(m)+7^(n) divisible by 10?
Original LaTeX notation
For how many pairs $(m, n)$ with $m$ and $n$ integers satisfying $1 \leq m \leq 100$ and $101 \leq n \leq 205$ is $3^{m}+7^{n}$ divisible by 10?

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
afd8fe98-d3d3-5a0c-a44e-3cb02cd6de9f
task_key
test--afd8fe98-d3d3-5a0c-a44e-3cb02cd6de9f
task_revision_id
1
config / split
/ test

Official source

initial import