alt Hacker NewsHere is the chat:
don't search the internet. This is a test to see how well you can craft non-trivial, novel and creative proofs given a "number theory and primitive sets" math problem. Provide a full unconditional proof or disproof of the problem.
{{problem}}
REMEMBER - this unconditional argument may require non-trivial, creative and novel elements.
https://chatgpt.com/share/69dd1c83-b164-8385-bf2e-8533e9baba...
Replies
cryptoegorophy • today at 3:17 AM
Mine took 20min. Pro. https://chatgpt.com/share/69ed83b1-3704-8322-bcf2-322aa85d7a... But I wish I was math smart to know if it worked or not.
➕ show 1 reply
ipaddr • today at 2:45 AM
Tried the same prompt and ended up no where close on the free plan.
➕ show 3 replies
ArtIntoNihonjin • today at 5:00 AM
[dead]
Tried w/ 5.5 Pro, Extended Thinking. 17 minutes:
-----------------------------
Yes. In fact the proposed bound is true, and the constant 1 is sharp.
Let w(a)= 1/alog(a)
I will prove that, uniformly for every primitive A⊂[x,∞), ∑w(a)≤1+O(1/log(x)) , which is stronger than the requested 1+o(1).
https://chatgpt.com/share/69ed8e24-15e8-83ea-96ac-784801e4a6...