VibeMathedMath problems solved by AI
All problems

Divisibility Set of the Generalized Euler Totient

Define φk(n)=1an,(a,n)=1ak\varphi_k(n) = \sum_{1 \le a \le n, (a,n)=1} a^k and Ds={ks:φs(n)φk(n) for every n}\mathcal{D}_s = \{k \ge s : \varphi_s(n) \mid \varphi_k(n) \text{ for every } n\}. Is D1={1,3,15}\mathcal{D}_1 = \{1, 3, 15\}, as conjectured by Büyükaşik and collaborators?

Result
Proved
Status
Resolved
AI contribution
AI co-developed
Method
Argument
Field
Multiplicative number theory
Posed by
Engin Büyükaşik et al.
Year posed
2024
Years open
2y
Solved
2026-06-01
Model
GPT-5.5 Pro
Vendor
OpenAI
Collaborators
John M. Campbell
Verification
Unreviewed
Publication
Preprint
Significance
5 / 100
Disclosed cost
Wikipedia
No dedicated article

What the AI did

The exact classification was proved via an argument based on interactions with GPT-5.5 Pro.

Verification

Author-checked arXiv preprint. Not yet peer-reviewed.

Source

arXiv:2606.01633 - On a problem on a generalization of Euler's totient function

Discussion