Related papers: Maximum Nim and Josephus Problem

The authors present formulas for the previous player's winning positions of two variants of restricted Nim. In both of these two games, there is one pile of stones, and in the first variant, we investigate the case that in k-th turn, you…

This paper presents a study of restricted Nim with a pass. In the restricted Nim considered in this study, two players take turns and remove stones from the piles. In each turn, when the number of stones is m, each player is allowed to…

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. Maximization of such functions subject to various constraints receives little…

This work is devoted to the study of first order linear problems with involution and periodic boundary value conditions. We first prove a correspondence between a large set of such problems with different involutions to later focus our…

This article provide new approach to solve P vs NP problem by using cardinality of bases function. About NP-Complete problems, we can divide to infinite disjunction of P-Complete problems. These P-Complete problems are independent of each…

We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the…

We investigate an extension of an equilibrium-type result, conjectured by Ambrus, Ball and Erd\'elyi, and proved recently by Hardin, Kendall and Saff. These results were formulated on the torus, hence we also work on the torus, but one of…

In the Feline Josephus problem, soldiers stand in a circle, each having $\ell$ `lives'. Going around the circle, a life is taken from every $k$th soldier; soldiers with 0 lives remaining are removed from the circle. Finding the last…

Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…

One of the classical problems concerns the class of analytic functions $f$ on the open unit disk $|z|<1$ which have finite Dirichlet integral $\Delta(1,f)$, where $$\Delta(r,f)=\iint_{|z|<r}|f'(z)|^2 \, dxdy \quad (0<r\leq 1). $$ The class…

For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $\lambda(k)$ at a…

In this short note, we derive an upper-bound for the sum of two comparison functions, namely for the sum of a class K and an extended class K function. To the best of our knowledge, the relations derived in this note have not been…

We consider constraints on the measure of the support for integrable functions on arbitrary measure spaces. It is shown that this non-convex and discontinuous constraint can be equivalently reformulated by the difference of two convex and…

In this note, we propose a formula for the subdifferential of the maximum functional $m(f) = \max_K f$ on the space of real-valued continuous functions $f$ defined on an arbitrary metric compact $K$. We show that, given $f$, the…

Let $[\, \cdot\,]$ be the floor function. In this paper we show that every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p_1\log p_1]+[p_2\log p_2]+[p_3\log p_3], \end{equation*} where $p_1,\,…

Let $K$ be a nonempty finite subset of the Euclidean space $\mathbb{R}^k$ $(k\ge 2)$. We prove that if a function $f\colon \mathbb{R}^k\to \mathbb{C}$ is such that the sum of $f$ on every congruent copy of $K$ is zero, then $f$ vanishes…

Consider the commonly known puzzle, given $k$ glass balls, find an optimal algorithm to determine the lowest floor of a building of $n$ floors from which a thrown glass ball will break. This puzzle was originally posed in its original form…

Simon's problem is a standard example of a problem that is exponential in classical sense, while it admits a polynomial solution in quantum computing. It is about a function $f$ for which it is given that a unique non-zero vector $s$ exists…

A thorough analysis of values of the function $m\mapsto\mbox{sn}(K(m)u\mid m)$ for complex parameter $m$ and $u\in (0,1)$ is given. First, it is proved that the absolute value of this function never exceeds 1 if $m$ does not belong to the…