benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Call a positive integer N≥2 "special" if for every k such that 2≤k≤N,N can be expressed as a sum of k positive integers that are relatively prime to N (although not necessarily rel…

Problem

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

problem

Call a positive integer N≥2N \geq 2 "special" if for every kk such that 2≤k≤N,N2 \leq k \leq N, N can be expressed as a sum of kk positive integers that are relatively prime to NN (although not necessarily relatively prime to each other). How many special integers are there less than 100100?
Plain-text mathematical notation (without MathML)
Call a positive integer N≥2 "special" if for every k such that 2≤k≤N,N can be expressed as a sum of k positive integers that are relatively prime to N (although not necessarily relatively prime to each other). How many special integers are there less than 100?
Original LaTeX notation
Call a positive integer $N \geq 2$ "special" if for every $k$ such that $2 \leq k \leq N, N$ can be expressed as a sum of $k$ positive integers that are relatively prime to $N$ (although not necessarily relatively prime to each other). How many special integers are there less than $100$?

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
1d98ae9f-1c29-5470-88b6-912f3568578b
task_key
test--1d98ae9f-1c29-5470-88b6-912f3568578b
task_revision_id
1
config / split
/ test

Official source

initial import