SIMON-MARAIS 2019 B2
- Paper B
For each odd prime number , prove that the integer is divisible by (Here, denotes the base of the natural logarithm and denotes the largest integer that is less than or equal to .)
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.