Game values of arithmetic functions

01/19/2021
by   Douglas E. Iannucci, et al.
0

Arithmetic functions in Number Theory meet the Sprague-Grundy function from Combinatorial Game Theory. We study a variety of 2-player heap games induced by standard arithmetic functions, such as divisors, relatively prime numbers, and their negations. For the ruleset induced by the division algorithm, we prove that the relative Sprague-Grundy values tend to 0 with increasing heap sizes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2017

The Game of Blocking Pebbles

Graph Pebbling is a well-studied single-player game on graphs. We introd...
research
11/08/2019

Induced arithmetic removal: complexity 1 patterns over finite fields

We prove an arithmetic analog of the induced graph removal lemma for com...
research
08/08/2021

Improving MATLAB's isprime performance without arbitrary-precision arithmetic

MATLAB is a numerical computing platform used by scientists, engineers, ...
research
11/23/2020

Arithmetic Expression Construction

When can n given numbers be combined using arithmetic operators from a g...
research
01/26/2021

Investment vs. reward in a competitive knapsack problem

Natural selection drives species to develop brains, with sizes that incr...
research
03/31/2022

Decidability bounds for Presburger arithmetic extended by sine

We consider Presburger arithmetic extended by the sine function, call th...
research
01/27/2023

An Arithmetic Theory for the Poly-Time Random Functions

We introduce a new bounded theory RS^1_2 and show that the functions whi...

Please sign up or login with your details

Forgot password? Click here to reset