benchmarks.wiki / Public workspace

MATH / Let n be a positive integer. How many different values can gcd(n+5,n+11) attain?

Problem

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

problem

Let nn be a positive integer. How many different values can gcd(n+5,n+11)\gcd(n + 5, n + 11) attain?
Plain-text mathematical notation (without MathML)
Let n be a positive integer.  How many different values can gcd(n+5,n+11) attain?
Original LaTeX notation
Let $n$ be a positive integer.  How many different values can $\gcd(n + 5, n + 11)$ attain?

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