benchmarks.wiki / Public workspace

Omni-MATH / What is the smallest value that the sum of the digits of the number 3n²+n+1, n∈N can take?

Problem

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

problem

What is the smallest value that the sum of the digits of the number 3n2+n+1,3n^2+n+1, n∈Nn\in\mathbb{N} can take?
Plain-text mathematical notation (without MathML)
What is the smallest value that the sum of the digits of the number 3n²+n+1, n∈N can take?
Original LaTeX notation
What is the smallest value that the sum of the digits of the number $3n^2+n+1,$ $n\in\mathbb{N}$ can take?

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