Related papers: Seeds for Generalized Taxicab Numbers

Let $G$ be a $t$-uniform hypergraph, and let $c(G)$ denote the cyclic index of the adjacency tensor of $G$. Let $m,s,t$ be positive integers such that $t \ge 2$, $s \ge 2$ and $m=st$. The generalized power $G^{m,s}$ of $G$ is obtained from…

For $ k \geq 2 $, we let $ A = (a_{1}, a_{2}, \ldots, a_{k}) $ be a $k$-tuple of positive integers with $\gcd(a_{1}, a_2, \ldots, a_k) =1$ and, for a non-negative integer $s$, the generalized Frobenius number of $A$, $g(A;s) = g(a_1, a_2,…

For various positive integers $k$, the sums of $k$th powers of the first $n$ positive integers, $S_k(n+1)=1^k+2^k+...+n^k$, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each $k\ge 2 $$…

A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$ of order $s$ has size at least $t$. In 2024, Zhan conjectured that every $2$-connected $[p + 2, p]$-graph of order at least $2p + 3$ and with minimum degree at least $p$…

An integer of the form $P_8(x)=3x^2-2x$ for some integer $x$ is called a generalized octagonal number. A quaternary sum $\Phi_{a,b,c,d}(x,y,z,t)=aP_8(x)+bP_8(y)+cP_8(z)+dP_8(t)$ of generalized octagonal numbers is called {\it universal} if…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

For integers $x$ and $y$, $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of $x$ and $y$ respectively. Denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive…

The bipartite Ramsey number $B(n_1,n_2,\ldots,n_t)$ is the least positive integer $b$ such that, any coloring of the edges of $K_{b,b}$ with $t$ colors will result in a monochromatic copy of $K_{n_i,n_i}$ in the $i-$th color, for some $i$,…

For two coprime positive integers $a,b$, let $T(a,b)=\{ ax+by : x,y\in \mathbb{Z}_{\ge 0} \} $ and let $s(a,b)=ab-a-b$. It is well known that all integers which are greater than $s(a,b)$ are in $T(a,b)$. Let $\pi (a, b)$ be the number of…

A positive integer $n$ is defined to be cyclic if and only if every group of size $n$ is cyclic. Equivalently, $n$ is cyclic if and only if $n$ is relatively prime to the number of positive integers less than $n$ that are relatively prime…

A positive integer $n$ is said to be $k$-layered if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we start the systematic study of these class of numbers. In particular, we state some algorithms to find some…

The number of non-isomorphic cubic fields L sharing a common discriminant d(L) = d is called the multiplicity m = m(d) of d. For an assigned value of d, these fields are collected in a multiplet M(d) = (L(1) ,..., L(m)). In this paper, the…

Let $(x, y)$ and $[x, y]$ denote the greatest common divisor and the least common multiple of the integers $x$ and $y$ respectively. We denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive integers and…

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,…

The purpose of this paper is to introduce the concept of reflecting numbers to the realm of number theory and to classify reflecting numbers of certain types. For us, reflecting numbers are coming from congruent numbers, above congruent…

The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest path. In this paper it is proved that the general position…

We give a formula for the density of $0$ in the sequence of generalized Motzkin numbers, $M^{a, b}_n$, modulo a prime, $p$, in terms of the first $p$ generalized central trinomial coefficients $T^{a, b}_n\bmod p$ (with $n<p$). We apply our…

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

For a positive integer $n$, let $\mathcal T(n)$ be the set of all integers greater than or equal to $n$. An integral quadratic form $f$ is called tight $\mathcal T(n)$-universal if the set of nonzero integers that are represented by $f$ is…

In this paper, we study universal sums of triangular numbers and squares. Specifically, we prove that a sum of triangular numbers and squares is universal if and only if it represents…