Related papers: Sprague-Grundy Value for Common Divisor Nim

One of the important open problems in the theory of central simple algebras is to compute the essential dimension of $\operatorname{GL}_n/\mu_m$, i.e., the essential dimension of a generic division algebra of degree $n$ and exponent…

We present a new smoothness result for Caputo-type fractional ordinary differential equations, which reveals that, subtracting a non-smooth function that can be obtained by the information available, a non-smooth solution belongs to $ C^m $…

In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG). In a classical congestion game, multiple users share the same…

In this article, we study the structure, and in particular the Grundy values, of a family of games known as memgames.

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

Let D(n) be the set of all fractions in the unit interval whose denominator in lowest terms equals $n$. We evaluate the product of the values of the Gamma function at the points of D(n), as a function of $n$; the answer depends on whether…

Let A be a finite subset of the naturals and let n be a natural. Let NIM(A;n) be the two player game in which players alternate removing $a\in A$ stones from a pile with $n$ stones; the first player who cannot move loses. This game has been…

We construct a new arithmetic-term representation for the function gcd(a,b). As a byproduct, we also deduce a representation gcd(a,b) by a modular term in integer arithmetic.

We give asymptotic estimates for the mean number of divisors of integers without small prime factors, integers with bounded ratios of consecutive divisors, and for practical numbers. In the last case, this confirms a conjecture of…

Consider the congruence class R_m(a)={a+im:i\in Z} and the infinite arithmetic progression P_m(a)={a+im:i\in N_0}. For positive integers a,b,c,d,m the sum of products set R_m(a)R_m(b)+R_m(c)R_m(d) consists of all integers of the form…

In this article, we provide an explicit constant $C$ such that there is no regular ternary sum of generalized $m$-gonal numbers for any integer $m$ greater than $C$.

We use mathematical statistics theory to derive the Compound-Dirichlet-Multinomial (CDM) prediction model. We then use this model to predict winning numbers for the 6-number, 5-number, pick-4 and pick-3 lottery games. We also develop a…

Suppose that $ m\equiv 1\mod 4 $ is a prime and that $ n\equiv 3\mod 4 $ is a primitive root modulo $ m $. In this paper we obtain a relation between the class number of the imaginary quadratic field $ \Q(\sqrt{-nm}) $ and the digits of the…

Using a recent improvement by Bettin and Chandee to a bound of Duke, Friedlander and Iwaniec~(1997) on double exponential sums with Kloosterman fractions, we establish a uniformity of distribution result for the fractional parts of Dedekind…

Representing probability distributions by the gradient of their density functions has proven effective in modeling a wide range of continuous data modalities. However, this representation is not applicable in discrete domains where the…

We introduce the notion of invariant vectors of a game and develop the Invariance Reduction Process, which first uses reduction of positions via invariance and then zero and merge reductions of games to arrive at smaller, solved sub-games…

The zero divisor graph of a commutative ring $R$ with unity is a graph whose vertices are the nonzero zero-divisors of the ring, with two distinct vertices being adjacent if their product is zero. This graph is denoted by $\Gamma(R)$. In…

A set $\mathcal S\subset \mathbb N$ is said to be a subset-sum-distinct or dissociated if all of its finite subsets have different sums. Alternately, an equivalent classification is if any equality of the form $$\sum_{s\in \mathcal S}…

We use a dynamic programming algorithm to establish a new lower bound on the domination number of complete cylindrical grid graphs of the form $C_n\square P_m$, that is, the Cartesian product of a path and a cycle, when $n\equiv 2\pmod{5}$,…

We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over the rationals.