中文
相关论文

相关论文: Seeds for Generalized Taxicab Numbers

200 篇论文

For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…

数论 · 数学 2020-07-21 Hai-Liang Wu

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

组合数学 · 数学 2009-06-12 E. Rodney Canfield , Brendan D. McKay

Let $p$ be a prime. We define $S(p)$ the smallest number $k$ such that every positive integer is a sum of at most $k$ squares of integers that are not divisible by $p$. In this article, we prove that $S(2)=10$, $S(3)=6$, $S(5)=5$, and…

数论 · 数学 2018-05-09 Kyoungmin Kim , Byeong-Kweon Oh

A generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$ with $b,c\in\mathbb Z$. In this paper we investigate congruences and series for sums of terms related to central binomial…

数论 · 数学 2014-10-23 Zhi-Wei Sun

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the prefix of…

动力系统 · 数学 2016-05-17 Yuke Huang , Zhiying Wen

Let $m\in\mathbb{Z}$ be an integer and $L_m=\mathbb{Q}(\alpha)$ be the simplest cubic field with class number $h_m$ and conductor $\mathfrak{f}_m$ where $\alpha$ is a root of $f_m(X)=X^3-mX^2-(m+3)X-1$. Let $\mathcal{O}_{L_m}$ be the ring…

数论 · 数学 2026-04-07 Akinari Hoshi , Hiroaki Iida

Let $ p \ge 5 $ be a prime and let $ b, c \in \mathbb{Z} $. Denote by $ T_k(b,c) $ the generalized central trinomial coefficient, i.e., the coefficient of $ x^k $ in $ (x^2 + bx + c)^k $. In this paper, we establish congruences modulo $ p^3…

数论 · 数学 2026-01-01 Yassine Otmani , Hacene Belbachir

The Ramsey number r(K_s,Q_n) is the smallest positive integer N such that every red-blue colouring of the edges of the complete graph K_N on N vertices contains either a red n-dimensional hypercube, or a blue clique on s vertices. Answering…

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…

数论 · 数学 2011-11-17 Nick Harland

The generalized Ramsey number $R(G_1, G_2)$ is the smallest positive integer $N$ such that any red-blue coloring of the edges of the complete graph $K_N$ either contains a red copy of $G_1$ or a blue copy of $G_2$. Let $C_m$ denote a cycle…

组合数学 · 数学 2019-08-26 Ryan Alweiss

We show that Euler's relation and the Taxi-Cab relation are both solutions of the same equation. General solutions of sums of two consecutive cubes equaling the sum of two other cubes are calculated. There is an infinite number of relations…

数论 · 数学 2022-06-02 Vladimir Pletser

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…

动力系统 · 数学 2016-05-17 Yuke Huang , Zhiying Wen

Let a and b be positive integers with a \leq b. An (a,b)-triple is a set {x,ax+d,bx+ 2d}, where x,d \geq 1. Define T(a,b;r) to be the least positive integer n such that any r-coloring of {1,2...,n} contains a monochromatic (a,b)-triple.…

组合数学 · 数学 2012-01-20 Patrick Allen , Bruce M. Landman , Holly Meeks

Let $G$ be an additive finite abelian group with exponent $\exp(G)=m$. For any positive integer $k$, the $k$-th generalized Erd\H{o}s-Ginzburg-Ziv constant $\mathsf s_{km}(G)$ is defined as the smallest positive integer $t$ such that every…

组合数学 · 数学 2018-11-27 Dongchun Han , Hanbin Zhang

For given graphs $G_{1}, G_{2}, ... , G_{k}, k \geq 2$, the multicolor Ramsey number $R(G_{1}, G_{2}, ... , G_{k})$ is the smallest integer $n$ such that if we arbitrarily color the edges of the complete graph of order $n$ with $k$ colors,…

组合数学 · 数学 2017-07-24 Farideh Khoeini , Tomasz Dzido

Let $s(m,n)$ denote the classical \DED sum, where $n$ is a positive integer and $m\in\{0,1,\ldots, n-1\}$, $(m,n)=1$. For a given positive integer $k$, we describe a set of at most $k^2$ numbers $m$ for which $s(m,n)$ may be $\ge s(k,n)$,…

数论 · 数学 2017-01-11 Kurt Girstmair

Starting with Ramanujan's famous taxicab problem, we can study the solvability of the equations $p^n+q^n=r^n+s^n$ and, more generally, $p_1^{k_1}+\dots+p_m^{k_m}=0$ among polynomials.

数论 · 数学 2026-04-29 Katalin Gyarmati

For a positive integer $m>1$, if the generalized Markoff equation $a^2+b^2+c^2=3abc+m$ has a solution triple, then it has infinitely many solutions. We show that all positive solution triples are generated by a finite set of triples that we…

数论 · 数学 2023-07-21 A. Srinivasan , L. A. Calvo

The generalized Ramsey number $R(H, K)$ is the smallest positive integer $n$ such that for any graph $G$ with $n$ vertices either $G$ contains $H$ as a subgraph or its complement $\overline{G}$ contains $K$ as a subgraph. Let $T_n$ be a…

组合数学 · 数学 2019-11-19 Matthew Brennan

Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by…

形式语言与自动机理论 · 计算机科学 2009-07-30 Galina Jirásková , Alexander Okhotin