Related papers: On the problem of Molluzzo for the modulus 4

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

We prove that if $p \equiv 4,7 \pmod{9}$ is prime and $3$ is not a cube modulo $p$, then both of the equations $x^3+y^3=p$ and $x^3+y^3=p^2$ have a solution with $x,y \in \mathbb{Q}$.

In this work we study the space S(n) of positively oriented, simple n-gons with labeled vertices up to oriented similarity and M(n) the moduli space of simple n-gons as a quotient of S(n). We give a local description of S(n) and M(n) around…

For a smooth, compact Riemannian manifold (M,g) of dimension $N \geg 3$, we are interested in the critical equation $$\Delta_g u+(N-2/4(N-1) S_g+\epsilon h)u=u^{N+2/N-2} in M, u>0 in M,$$ where \Delta_g is the Laplace--Beltrami operator,…

Linear programming is a powerful method in combinatorial optimization with many applications in theory and practice. For solving a linear program quickly it is desirable to have a formulation of small size for the given problem. A useful…

In a previous article, we reduced the unsolved problem of the convergence of Collatz sequences, to convergence of Collatz sequences of odd numbers, that are divisible by 3. In this article, we further reduce this set to odd numbers that are…

In this paper, we propose a $C^{0}$ interior penalty method for $m$th-Laplace equation on bounded Lipschitz polyhedral domain in $\mathbb{R}^{d}$, where $m$ and $d$ can be any positive integers. The standard $H^{1}$-conforming piecewise…

We study the problem of whether rectangular polyominoes with holes are cube-foldable, that is, whether they can be folded into a cube, if creases are only allowed along grid lines. It is known that holes of sufficient size guarantee that…

This paper presents an innovative set of tools developed to support a methodology to find the left eigenvalues of $m$ order quaternion square matrix. It is solving four real polynomial equations of order not greater than $4m-3$ in four…

In the topos of simplicial sets, it makes sense to ask the following question about a given natural number $n$: what is the minimum value $m$ such that $n$-skeletality implies $m$-coskeletality? This is an instance of the Aufhebung relation…

The counting function for the numbers satisfying the Collatz conjecture is studied. A related exponential congruence equation is investigated, yielding a method to construct its solutions from free variables, and enabling us to find at…

Given a positive integer $m\ge 3$, let $ch(m)$ be the smallest positive constant with the following property: \emph{ Every simple directed graph on $n\ge 3$ vertices all whose outdegrees are at least $ch(m)\cdot n$ contains a directed cycle…

In $1961$, Mazur constructed a contractible, compact, smooth $4$-manifold with boundary which is not homeomorphic to the standard $4$-ball, using a $0$-handle, a $1$-handle and a $2$-handle. In this paper, for any integer $n\geq2,$ we…

We prove the non-planarity of a family of 3-regular graphs constructed from the solutions to the Markoff equation $x^2+y^2+z^2=xyz$ modulo prime numbers greater than 7. The proof uses Euler characteristic and an enumeration of the short…

We use modular symmetric designs to study the existence of Hadamard matrices modulo certain primes. We solve the $7$-modular and $11$-modular versions of the Hadamard conjecture for all but a finite number of cases. In doing so, we state a…

Let $\mathbb{Z}_4$ denote the ring of integers modulo $4$. The Galois ring GR$(4,m)$, which consists of $4^m$ elements, represents the Galois extension of degree $m$ over $\mathbb{Z}_4$. The constructions of codes over $\mathbb{Z}_4$ have…

This is a translation from the Latin of Euler's "Problema algebraicum de inveniendis quatuor numeris ex datis totidem productis uniuscuiusque horum numerorum in summas trium reliquorum", Opera Postuma 1 (1862), 282-287, reprinted in…

We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture is easier to explore because certain…

We consider small solutions of quadratic congruences of the form $x_1^2+\alpha_2x_2^2+\alpha_3x_3^2\equiv 0 \bmod{q}$, where $q=p^m$ is an odd prime power. Here, $\alpha_2$ is arbitrary but fixed and $\alpha_3$ is variable, and we assume…

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…