中文
相关论文

相关论文: Perfect squares have at most five divisors close t…

200 篇论文

How many squares are spanned by $n$ points in the plane? Here we study the corresponding maximum possible number $S_{\square}(n)$ of squares and determine the exact values for all $n\le 17$. For $18\le n\le 100$ we give lower bounds for…

组合数学 · 数学 2021-12-24 Sascha Kurz

Let n be a nonzero integer and assume that a set S of positive integers has the property that xy+n is a perfect square whenever x and y are distinct elements of S. In this paper we find some upper bounds for the size of the set S. We prove…

数论 · 数学 2021-08-30 Andrej Dujella

We prove there exist infinitely many odd integers $n$ for which there exists a pair of positive divisors $d_1, d_2>1$ of $(n^2+1)/2$ such that $$d_1+d_2=\delta n+(\delta+2).$$ We prove the similar result for $\varepsilon=\delta-2$ and…

数论 · 数学 2017-07-04 Sanda Bujačić Babić

Let $A$ be a set of $n$ positive integers. We say that a subset $B$ of $A$ is a divisor of $A$, if the sum of the elements in $B$ divides the sum of the elements in $A$. We are interested in the following extremal problem. For each $n$,…

组合数学 · 数学 2014-09-22 Tony Huynh

J.-P. Roudneff conjectured in 1991 that every arrangement of $n \ge 2d+1\ge 5$ pseudohyperplanes in the real projective space $\mathbb{P}^d$ has at most $\sum_{i=0}^{d-2} \binom{n-1}{i}$ complete cells (i.e., cells bounded by each…

We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…

组合数学 · 数学 2025-06-05 Seok Hyun Byun , Wayne Goddard

Iannucci considered the positive divisors of a natural number $n$ that do not exceed $\sqrt{n}$ and found all forms of numbers whose such divisors are in arithmetic progression. In this paper, we generalize Iannucci's result by excluding…

数论 · 数学 2021-06-07 Hung Viet Chu

Let P and Q be non-zero integers. The Lucas sequence U_n(P,Q) is defined by U_0=0, U_1=1, U_n= P*U_{n-1}-Q*U_{n-2} for n >1. The question of when U_n(P,Q) can be a perfect square has generated interest in the literature. We show that for…

数论 · 数学 2007-05-23 A. Bremner , N. Tzanakis

We resolve a conjecture of Hegarty regarding the number of edges in the square of a regular graph. If $G$ is a connected $d$-regular graph with $n$ vertices, the graph square of $G$ is not complete, and $G$ is not a member of two narrow…

组合数学 · 数学 2011-12-22 Michael Goff

P. Erd\H{o}s conjectured in 1962 that on the ring $\mathbb{Z}$, every set of $n$ congruence classes in $\mathbb{Z}$ that covers the first $2^n$ positive integers also covers the ring $\mathbb{Z}$. This conjecture was first confirmed in 1970…

数论 · 数学 2025-10-02 Rongyin Wang

We show that almost every positive integer can be expressed as a sum of four squares of integers represented as the sums of three positive cubes.

数论 · 数学 2020-12-17 Javier Pliego

We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…

最优化与控制 · 数学 2023-05-03 Amir Ali Ahmadi , Cemil Dibek

Iannucci considered the positive divisors of a natural number $n$ that do not exceed the square root of $n$ and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be…

数论 · 数学 2019-12-30 Hung Viet Chu

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…

代数几何 · 数学 2014-03-25 Wouter van Heijst

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…

组合数学 · 数学 2012-02-01 Noga Alon , Peter Frankl , Hao Huang , Vojtech Rodl , Andrzej Rucinski , Benny Sudakov

Triangles with integer length sides and integer area are known as Heron triangles. Taking rescaling freedom into account, one can apply the same name when all sides and the area are rational numbers. A perfect triangle is a Heron triangle…

数论 · 数学 2022-09-20 Andrew N. W. Hone

We prove that for every $\epsilon>0$ there exists $\delta>0$ such that the following holds. Let $\mathcal{C}$ be a collection of $n$ curves in the plane such that there are at most $(\frac{1}{4}-\epsilon)\frac{n^{2}}{2}$ pairs of curves…

组合数学 · 数学 2019-08-16 Istvan Tomon

Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same…

数论 · 数学 2020-08-26 Pankaj Jyoti Mahanta , Manjil P. Saikia , Daniel Yaqubi

For a positive integer $n$, let $\sigma(n)$ denote the sum of the positive divisors of $n$. Let $d$ be a proper divisor of $n$. We call $n$ a deficient-perfect number if $\sigma(n)=2n-d$. In this paper, we show that the only odd…

数论 · 数学 2019-08-15 Cui-Fang Sun , Zhao-Cheng He

For a given positive integer $k$, we prove that there are at least $x^{1/2-o(1)}$ integers $d\leq x$ such that the real quadratic fields $\mathbb Q(\sqrt{d+1}),\dots,\mathbb Q(\sqrt{d+k})$ have class numbers essentially as large as…