中文
相关论文

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

200 篇论文

It is proved that the discriminant of $n\times n$ real symmetric matrices can be written as a sum of squares, where the number of summands equals the dimension of the space of $n$-variable spherical harmonics of degree $n$. The…

表示论 · 数学 2012-06-13 M. Domokos

We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.

组合数学 · 数学 2015-09-28 Louis Esperet , Daniel Kral , Petr Skoda , Riste Skrekovski

We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these vertices in one of the colors is at least 2n/3. The previous best value,…

离散数学 · 计算机科学 2013-01-04 Daniel Král' , Chun-Hung Liu , Jean-Sébastien Sereni , Peter Whalen , Zelealem Yilma

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

数论 · 数学 2025-05-06 Ajai Choudhry

We prove that the maximal number of conics, a priori irreducible of reducible, on a smooth spatial quartic surface is 800, realized by a unique quartic. We also classify quartics with many (at least 720) conics. The maximal number of real…

代数几何 · 数学 2026-02-12 Alex Degtyarev

A finite set $A$ of integers is square-sum-free if there is no subset of $A$ sums up to a square. In 1986, Erd\H os posed the problem of determining the largest cardinality of a square-sum-free subset of $\{1, ..., n \}$. Answering this…

组合数学 · 数学 2009-10-30 Hoi Nguyen , Van Vu

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

组合数学 · 数学 2013-02-26 György Elekes , Endre Szabó

For an integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j+n is a perfect square for all 0<i<j<m+1, is called a D(n)-m-tuple. In this paper, we show that there are infinitely many essentially different…

数论 · 数学 2021-08-30 Andrej Dujella , Matija Kazalicki , Vinko Petričević

For a non-square positive integer x, let k_x denote the distance between x^3 and the perfect square closest to x^3. A conjecture of Marshall Hall states that the ratios r_x = (x^(1/2))/k_x, are bounded above. (Elkies has shown that any such…

数论 · 数学 2014-10-02 Ryan D'Mello

The Mondrian problem consists of dissecting a square of side length $n\in \NN$ into non-congruent rectangles with natural length sides such that the difference $d(n)$ between the largest and the smallest areas of the rectangles partitioning…

组合数学 · 数学 2020-07-21 C. Dalfó , M. A. Fiol , N. López

Legendre's Conjecture is one of the most elegant open problems in Number Theory, which states that there is a prime between consecutive two perfect squares. In this note, we prove the conjecture holds true and also discuss the related…

综合数学 · 数学 2019-08-27 Sundarakannan Mahilmaran

An old question posed by Erd\H{o}s asked whether there exists a set of $n$ points such that $c \cdot n$ distances occur more than $n$ times. We provide an affirmative answer to this question, showing that there exists a set of $n$ points…

组合数学 · 数学 2024-07-08 Krishnendu Bhowmick

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…

数论 · 数学 2023-06-23 Jörg Brüdern , Olivier Robert

A perfect cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The existence of such cuboids is neither proved, nor disproved. A rational perfect cuboid is a natural…

数论 · 数学 2012-08-02 Ruslan Sharipov

A Hilbert cube of dimension $d$ is the set of integers \[ H(a_{0}; a_{1}, \ldots, a_{d})=a_{0}+\{0, a_{1}\}+\cdots+\{0, a_{d}\}=\left\{a_{0}+\sum_{i=1}^{d}\varepsilon_{i}a_{i}:\;\varepsilon_{i}\in\{0,1\}\right\}. \] Brown, Erd\H{o}s and…

数论 · 数学 2026-04-08 Andrew Bremner , Christian Elsholtz , Maciej Ulas

The Erd\H{o}s-Mollin-Walsh conjecture, asserting the nonexistence of three consecutive powerful integers, remains a celebrated open problem in number theory. A natural line of inquiry, following recent work by Chan (2025), is to investigate…

数论 · 数学 2025-09-25 Jialai She

A subset $X$ of an abelian $G$ is said to be {\em complete} if every element of the subgroup generated by $X$ can be expressed as a nonempty sum of distinct elements from $X$. Let $A\subset \Z_n$ be such that all the elements of $A$ are…

数论 · 数学 2007-05-23 Y. O. Hamidoune , A. S. Lladó , O. Serra

Let $f(n)$ denote the maximum total length of the sides of $n$ squares packed inside a unit square. Erd\H{o}s conjectured that $f(k^2+1)=k$. We show that the conjecture is true if we assume that the sides of the squares are parallel to the…

组合数学 · 数学 2024-11-19 Jineon Baek , Junnosuke Koizumi , Takahiro Ueoro

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.

数论 · 数学 2009-03-27 Kent D. Boklan , Noam D. Elkies

We prove that for all $n\geq 1$ there exists a number between $n^2$ and $(n+1)^2$ with at most 4 prime factors. This is the first result of this kind that holds for every $n\geq 1$ rather than just sufficiently large $n$. Our approach…

数论 · 数学 2025-06-26 Adrian W. Dudek , Daniel R. Johnston