benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find an n such that n!−(n−1)!+(n−2)!−(n−3)!+⋯±1 ! is prime. Be prepared to justify your answer for left{begin{array}{c}n, {left[frac{n+225}{10}right],}end{array} n leq 25right. po…

Problem

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

problem

Find an nn such that n!−(n−1)!+(n−2)!−(n−3)!+⋯±1n!-(n-1)!+(n-2)!-(n-3)!+\cdots \pm 1 ! is prime. Be prepared to justify your answer for $\left\{\begin{array}{c}n, \\ {\left[\frac{n+225}{10}\right],}\end{array} n \leq 25\right.$ points, where [N][N] is the greatest integer less than NN.
Plain-text mathematical notation (without MathML)
Find an n such that n!−(n−1)!+(n−2)!−(n−3)!+⋯±1 ! is prime. Be prepared to justify your answer for $\left\{\begin{array}{c}n, \\ {\left[\frac{n+225}{10}\right],}\end{array} n \leq 25\right.$ points, where [N] is the greatest integer less than N.
Original LaTeX notation
Find an $n$ such that $n!-(n-1)!+(n-2)!-(n-3)!+\cdots \pm 1$ ! is prime. Be prepared to justify your answer for $\left\{\begin{array}{c}n, \\ {\left[\frac{n+225}{10}\right],}\end{array} n \leq 25\right.$ points, where $[N]$ is the greatest integer less than $N$.

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
fd1a9801-0499-505d-af4d-e14b64274909
task_key
test--fd1a9801-0499-505d-af4d-e14b64274909
task_revision_id
1
config / split
/ test

Official source

initial import