Related papers: The least common multiple of consecutive arithmeti…

Let $G$ be a graph with order $n$ and let $g, f : V (G)\rightarrow N$ such that $g(v)\leq f(v)$ for all $v\in V(G)$. We say that $G$ has all fractional $(g, f)$-factors if $G$ has a fractional $p$-factor for every $p: V (G)\rightarrow N$…

For a matrix $W \in \mathbb{Z}^{m \times n}$, $m \leq n$, and a convex function $g: \mathbb{R}^m \rightarrow \mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\{0,1\}^n$. We will study separable convex functions and…

We say a pair of integers $(a, b)$ is findable if the following is true. For any $\delta > 0$ there exists a $p_0$ such that for any prime $p \ge p_0$ and any red-blue colouring of $\mathbb{Z} /p\mathbb{Z}$ in which each colour has density…

Let s_k/t_k, k>= 0, be the convergents of the continued fraction expansion of a real number x. We investigate the sequence of Jacobi symbols (s_k/t_k), k>= 0. We show that this sequence is purely periodic with shortest possible period…

There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several new and tight results in this area. Let $G$ be a graph with minimum degree at least $k+1$. We prove that if $G$ is…

In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers $n$ and $k$, the expression $aw([n],k)$ denotes the smallest number of colors with which the…

For positive integers $s$ and $k_1, k_2, ..., k_s$, let $w(k_1,k_2,...,k_s)$ be the minimum integer $n$ such that any $s$-coloring $\{1,2,...,n\} \to \{1,2,...,s\}$ admits a $k_i$-term arithmetic progression of color $i$ for some $i$, $1…

The equality problem of the two-variable Bajraktarevi\'c means can be expressed as the functional equation $$ \left(\frac{f}{g}\right)^{-1}\bigg(\frac{f(x)+f(y)}{g(x)+g(y)}\bigg)…

In 1949, Motzkin proved that every Euclidean domain $R$ has a minimal Euclidean function, $\phi_R$. He showed that when $R = \mathbb{Z}$, the minimal function is $\phi_{\mathbb{Z}}(x) = \lfloor \log_2 |x| \rfloor$. For over seventy years,…

The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open…

The periodic points of the algebraic function defined by the equation $g(x,y) = x^3(4y^2+2y+1)-y(y^2-y+1)$ are shown to be expressible in terms of Ramanujan's cubic continued fraction $c(\tau)$ with arguments in an imaginary quadratic field…

The Carmichael lambda function $\lambda(n)$ is defined to be the smallest positive integer $m$ such that $a^m$ is congruent to 1 modulo $n,$ for all $a$ and $n$ relatively prime. The function $\lambda_k(n)$ is defined to be the $k$th…

In this paper, we present a method for estimating the least common multiple of a large class of binary linear recurrence sequences. Let $P,Q,R_0$, and $R_1$ be fixed integers and let $\boldsymbol{R}=\left(R_n\right)_{n}$ be the recurrence…

A cycle in an edge-colored graph is said to be rainbow if no two of its edges have the same color. For a complete, infinite, edge-colored graph $G$, define $\mathfrak{S}(G)=\{n\ge 2\;|\;\text{no $n$-cycle of $G$ is rainbow}\}$. Then…

We investigate the function $L(h,p,q)$, called here the threshold function, related to periodicity of partial words (words with holes). The value $L(h,p,q)$ is defined as the minimum length threshold which guarantees that a natural…

If $a$ and $d$ are relatively prime, we refer to the set of integers congruent to $a$ mod $d$ as an `eligible' arithmetic progression. A theorem of Dirichlet says that every eligible arithmetic progression contains infinitely many primes;…

$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective on number representation and approximation. While numerous $p$-adic…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

Ron Graham introduced a function, $g(n)$, on the non-negative integers, in the 1986 Issue $3$ Problems column of \textit{Mathematical Magazine}: For each non-negative integer $n$, $g(n)$ is the least integer $s$ so that the integers $n + 1,…

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…