benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A positive integer n is picante if n ! ends in the same number of zeroes whether written in base 7 or in base 8 . How many of the numbers 1,2,…,2004 are picante?

Problem

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

problem

A positive integer nn is picante if nn ! ends in the same number of zeroes whether written in base 7 or in base 8 . How many of the numbers 1,2,…,20041,2, \ldots, 2004 are picante?
Plain-text mathematical notation (without MathML)
A positive integer n is picante if n ! ends in the same number of zeroes whether written in base 7 or in base 8 . How many of the numbers 1,2,…,2004 are picante?
Original LaTeX notation
A positive integer $n$ is picante if $n$ ! ends in the same number of zeroes whether written in base 7 or in base 8 . How many of the numbers $1,2, \ldots, 2004$ are picante?

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
037c0d0a-57ba-545c-bb62-25f0f5eb9823
task_key
test--037c0d0a-57ba-545c-bb62-25f0f5eb9823
task_revision_id
1
config / split
/ test

Official source

initial import