benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Determine the smallest positive integer n such that there exists positive integers a₁,a₂,⋯,a_(n), that smaller than or equal to 15 and are not necessarily distinct, such that the l…

Problem

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

problem

Determine the smallest positive integer n n such that there exists positive integers a1,a2,⋯,an a_1,a_2,\cdots,a_n, that smaller than or equal to 15 15 and are not necessarily distinct, such that the last four digits of the sum, \[ a_1!\plus{}a_2!\plus{}\cdots\plus{}a_n!\] Is 2001 2001.
Plain-text mathematical notation (without MathML)
Determine the smallest positive integer n such that there exists positive integers a₁,a₂,⋯,a_(n), that smaller than or equal to 15 and are not necessarily distinct, such that the last four digits of the sum,

\[ a_1!\plus{}a_2!\plus{}\cdots\plus{}a_n!\]

Is 2001.
Original LaTeX notation
Determine the smallest positive integer $ n$ such that there exists positive integers $ a_1,a_2,\cdots,a_n$, that smaller than or equal to $ 15$ and are not necessarily distinct, such that the last four digits of the sum,

\[ a_1!\plus{}a_2!\plus{}\cdots\plus{}a_n!\]

Is $ 2001$.

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
cbba85cb-5685-5dfa-aa55-18a6bd16f598
task_key
test--cbba85cb-5685-5dfa-aa55-18a6bd16f598
task_revision_id
1
config / split
/ test

Official source

initial import