中文
相关论文

相关论文: Restrictions of $m$-Wythoff Nim and $p$-complement…

200 篇论文

We give short rules for two-pile take-away games satisfying that a pair of complementary homogeneous Beatty sequences together with $(0,0)$ constitute a complete set of $P$-positions.

组合数学 · 数学 2011-03-21 Urban Larsson

We find conditions under which the P-positions of three subtraction games arise as pairs of complementary Beatty sequences. The first game is due to Fraenkel and the second is an extension of the first game to non-monotone settings. We show…

组合数学 · 数学 2023-04-13 Jon Kay , Geremias Polanco

Wythoff's Game is a variation of Nim in which players may take an equal number of stones from each pile or make valid Nim moves. W. A. Wythoff proved that the set of P-Positions (losing position), $C$, for Wythoff's Game is given by $C :=…

组合数学 · 数学 2017-02-16 Shubham Aggarwal , Jared Geller , Shuvom Sadhuka , Max Yu

In this paper we study a family of 2-pile Take Away games, that we denote by Generalized Diagonal Wythoff Nim (GDWN). The story begins with 2-pile Nim whose sets of options and $P$-positions are $\{\{0,t\}\mid t\in \N\}$ and $\{(t,t)\mid…

组合数学 · 数学 2010-05-11 Urban Larsson

We determine the full nim-value structure of additive subtraction games in the {\em primitive quadratic} regime. The problem appears in Winning Ways by Berlekamp et al. in 1982; it includes a closed formula, involving Beatty-type {\em…

组合数学 · 数学 2026-03-31 Urban Larsson , Hikaru Manabe

We generalise Uspensky's theorem characterising eventual exact (e.e.) covers of the positive integers by homogeneous Beatty sequences, to e.e. m-covers, for any m \in \N, by homogeneous sequences with irrational moduli. We also consider…

数论 · 数学 2010-08-16 Peter Hegarty

Wythoff's Nim is a variant of 2-pile Nim in which players are allowed to take any positive number of stones from pile 1, or any positive number of stones from pile 2, or the same positive number from both piles. The player who makes the…

组合数学 · 数学 2024-08-08 Mirabel Hu , Daniel Sleator , William Tsin

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

数论 · 数学 2019-12-03 C. G. Karthick Babu

Bounds for $\max\{m,\tilde{m}\}$ subject to $m,\tilde{m} \in \mathbb{Z}\cap[1,p)$, $p$ prime, $z$ indivisible by $p$, $m\tilde{m}\equiv z\bmod p$ and $m$ belonging to some fixed Beatty sequence $\{ \lfloor n\alpha+\beta \rfloor :…

数论 · 数学 2023-06-05 Marc Technau

The authors introduce the impartial game of the generalized Ry\=u\=o Nim, a variant of the classical game of Wythoff Nim. In the latter game, two players take turns in moving a single queen on a large chessboard, attempting to be the first…

We study variations of classical combinatorial games on two finite heaps of tokens, a.k.a. \emph{subtraction games}. Given non-negative integers $p_1,q_1, p_2,q_2$, where $p_1q_2 > q_1p_2$, $p_1>0$ and $q_2>0$, two players alternate in…

组合数学 · 数学 2012-02-09 Urban Larsson

We study impartial take away games on 2 unordered piles of finite nonnegative numbers of tokens $(x,y)$. Two players alternate in removing at least one and at most all tokens from the respective piles, according to certain rules, and the…

组合数学 · 数学 2012-06-21 Urban Larsson

We obtain best possible results for the number of coprime positive integer solutions of the equation in the title when $a$ is a positive integer, $b=p^{m}$, $2p^{m}$ or $4p^{m}$, where $m$ is a non-negative integer, $p$ is prime, $\gcd…

数论 · 数学 2026-04-17 Paul M Voutier

We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game, known as {\em Blocking Wythoff Nim}, consists of moving a…

组合数学 · 数学 2015-06-05 Matthew Cook , Urban Larsson , Turlough Neary

We study the problem whether there exist variants of {\sc Wythoff}'s game whose $\P$-positions, except for a finite number, are obtained from those of {\sc Wythoff}'s game by adding a constant $k$ to each $\P$-position. We solve this…

组合数学 · 数学 2014-03-12 Aviezri S. Fraenkel , Nhan Bao Ho

We introduce a variant of Wythoff's Game that we call $m$-Modular Wythoff's Game. In the original Wythoff's Game, players can take a positive number of tokens from one pile, or they can take a positive number of tokens from both piles if…

组合数学 · 数学 2024-02-22 Tanya Khovanova , Shuheng Niu

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

数论 · 数学 2016-12-06 William D. Banks , Victor Z. Guo

Let $\alpha,\beta$ be real numbers such that $\alpha>1$ is irrational and of finite type, and let $c$ be a real number in the range $1<c<\frac{14}{13}$. In this paper, it is shown that there are infinitely many Piatetski-Shapiro primes $p =…

数论 · 数学 2015-02-20 Victor Z. Guo

We introduce a new generalization of Wythoff Nim using three piles of stones. We show that its P-positions have finite difference properties and produce a partition of positive integers. Further, we give a conjecture that the P-positions…

组合数学 · 数学 2024-12-25 Shigeki Akiyama

Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equation \begin{align*} B_mB_{m+d}\dots…

数论 · 数学 2016-07-27 Lajos Hajdu , Shanta Laishram , Márton Szikszai
‹ 上一页 1 2 3 10 下一页 ›