Abstract: Arithmetic functions in Number Theory meet the Sprague-Grundy function from Combinatorial Game Theory. We study a variety of 2-player games induced by standard arithmetic functions, such as Euclidian division, divisors, remainders and relatively prime numbers, and their negations.
Recommendations
Cites work
- An Arithmetic Function Arising From the /phi Function
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Partition games
- Wythoff partizan subtraction
Cited in
(7)- Some studies on a class of combinatorial optimization function
- Min, a combinatorial game having a connection with prime numbers
- Game values of arithmetic functions
- Two games on arithmetic functions: SALIQUANT and NONTOTIENT
- Sprague-Grundy functions for certain infinite acyclic graphs
- Odd case of 2-pile divisor Nim
- Winning strategy and periodicity of m-pile divisor nim
This page was built for publication: Game values of arithmetic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390729)