News for hackers. Stuff that matters.

A comment on Ask HN: Share your AI prompt that stumps every model. Parent comment

Re:Ask HN: Share your AI prompt that stumps every model by bobxmax on Thursday April 24, 2025 @07:50PM (#43788765)
Since any group of order 3⋅2n3⋅2n has ∣G∣≥3∣G∣≥3, it cannot admit a Cayley graph which is a tree. Hence:

    No Cayley graph of a group of order 3⋅2n3⋅2n can have a unique path between every pair of vertices.
[ Parent | on HN ]
Re:Ask HN: Share your AI prompt that stumps every model by leifmetcalf on Thursday April 24, 2025 @07:51PM (#43788775)
My mistake, I said unique path when I should have said unique shortest path.

Also, there are trivial solutions with odd cycles and complete graphs which must be excluded. (So the answer to the prompt as originally stated is wrong too)

[ Parent | on HN ]