Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Post History

#1: Initial revision by user avatar celtschk‭ · 2022-10-09T09:17:14Z (about 2 years ago)
Does there exist a non-zero game such that the sum of three or more copies of it is zero?
In combinatorial game theory, there are non-zero games $G$ with the property $G+G=0$; this is in particular true for all impartial games.

Now I wonder if there also exist non-zero games such that $G+G+G=0$. I don't see an obvious reason why those shouldn't exist, but I also have no idea on how to construct such a game.

Such a game obviously has to be a fuzzy game, as the sum of two positive games is positive, and the sum of two negative games is negative. Also, clearly $G\ne -G$, or else $G+G+G = G+(-G)+G = G \ne 0$. But beyond that, I'm out of ideas.

It would  also be interesting for larger numbers than three. If for $n\in\mathbb N$ we define $nG$ as the sum of $n$ copies of $G$, for which (if any) $n>2$ does there exist a game such that $nG=0$, but $mG\ne 0$  for $0<m<n$?