benchmarks.wiki / Public workspace

MATH / Suppose a and b are different prime numbers greater than 2. How many whole-number divisors are there for the integer a(2a+b)−2a²+ab?

Problem

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

problem

Suppose aa and bb are different prime numbers greater than 2. How many whole-number divisors are there for the integer a(2a+b)−2a2+aba(2a+b)-2a^{2}+ab?
Plain-text mathematical notation (without MathML)
Suppose a and b are different prime numbers greater than 2. How many whole-number divisors are there for the integer a(2a+b)−2a²+ab?
Original LaTeX notation
Suppose $a$ and $b$ are different prime numbers greater than 2. How many whole-number divisors are there for the integer $a(2a+b)-2a^{2}+ab$?

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