Aleksandar Ivić, Žarko Mijajlović
We discuss some problems in number theory posed by Djuro Kurepa (1907-1993), including his classical left factorial hypothesis that an odd prime $p$ does not divide $0! + 1! + ... + (p-1)!$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Kurepa's hypothesis asserts that for each integer $n\ge 2$ the greatest common divisor of $!n:=\sum_{k=0}^{n-1}k!$ and $n!$ is $2$. Motivated by an equivalent formulation of this hypothesis involving derangement numbers, here we give a formulation of Kurepa's hypothesis in terms of divisibility of any Kurepa's determinant $K_p$ of order $p-4$ by a prime $p\ge 7$. In the previous version of this article we have proposed the strong Kurepa's hypothesis involving a general Kurepa's determinant $K_n$ with any integer $n\ge 7$. We prove the ``even part'' of this hypothesis which can be considered as…
Lehmer's totient problem asks if there exists a composite number $d$ such that its totient divide $d-1$. In this article we generalize the Lehmer's totient problem in algebraic number fields. We introduce the notion of a Lehmer number. Lehmer numbers are defined to be the natural numbers which obey the Lehmer's problem in the ring of algebraic integers of a number field.
This paper concerns the number of lattice points in a circle.
Let $\mathbb{N}_0$ be a class of natural numbers whose binary expansions contain even numbers of ones. Waring problem in numbers of class $\mathbb{N}_0$ is solved.
We give an historical account, including recent progress, on some problems of Erd\H os in number theory.
In this article, we study the Piltz divisor problem, which is sometimes called the generalized Dirichlet divisor problem, over number fields. We establish an identity akin to Voronoï's formula concerning the error term in the Dirichlet divisor problem.
Two Problems on Narayana Numbers And Repeated Digit Numbers
本文研究Narayana数与重复数字数之间的乘积关系，完整刻画了可表示为Narayana数与重复数字数乘积的重复数字数，以及两个重复数字数乘积为Narayana数的情形。
The determination of the class number of totally real fields of large discriminant is known to be a difficult problem. The Minkowski bound is too large to be useful, and the root discriminant of the field can be too large to be treated by Odlyzko's discriminant bounds. We describe a new technique for determining the class number of such fields, allowing us to attack the class number problem for a large class of number fields not treatable by previously known methods. We give an application to Weber's class number problem, which is the conjecture that all real cyclotomic fields of power of 2 co…
We study some number theory problems related to the harmonic analysis (Fourier bases) of the Cantor set introduced by Jorgensen and Pedersen in \cite{JP98}.
The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$ and finding the Frobenius number is called the Frobenius problem. In this paper, we introduce the Frobenius problem for numerical semigroups generated by Thabit number base b and Thabit number of the second kind base b which are motivated by the Frobenius problem for Thabit numerical semigroups. Also, we introduce the Frobenius problem for numerical semigroups generated by Cunningham number and Fermat number base $b$
This paper gives an heuristic lower bound for the number of integers connected to 1 and less than $x$, $θ(x) > 0.9x,$ in the context of the $3n+1$ problem.
We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this function for many cases. Our proof uses the estimate of exponential sums. We also show uniform results for ideal counting function and relatively $r$-prime lattice points as one of applications.
The Piltz divisor Problem in Number Fields Using The Resonance Method
本文在数域上研究Piltz除数问题，通过推广Soundararajan的Voronoi型公式并应用第二作者的近期结果，成功获得了误差项改进的$\Omega-$界。
A class number problem for imaginary cyclic number fields of 2-power degrees
本文将M. K. Ram关于虚循环四次数域类数不等于特定素数的结论，大幅推广至2的幂次阶非二次虚循环数域且类数非素数的情形。
We investigate the class number one problem for a parametric family of real quadratic fields of the form $\mathbb{Q}( \sqrt{m^2+4r})$ for certain positive integers $m$ and $r$.
We solve unconditionally the class number one problem for the $2$-parameter family of real quadratic fields $\mathbb{Q}(\sqrt{d})$ with square-free discriminant $d=(an)^2+4a$ for positive odd integers $a$ and $n$.
Bounds for the relative class number problem for function fields
本文为函数域有限可分扩张建立相对类数界，将分类问题化为有限计算，并解决了常数域非 $\mathbb{F}_2$ 时的相对类数二问题。
In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 2.
In this note we give an explicit parametrization of the modular curve associated to the normalizer of a non-split Cartan subgroup of level 9. We determine all integral points of this modular curve. As an application, we give an alternative solution to the class number one problem.
The CM class number one problem for elliptic curves asked to find all elliptic curves defined over the rationals with non-trivial endomorphism ring. For genus-2 curves it is the problem of determining all CM curves of genus $2$ defined over the reflex field. We solve the problem by showing that the list given in Bouyer and Streng [LMS J. Comput. Math., 18(1):507{538, 2015] is complete.
A Shifted Sum for the Congruent Number Problem
本文构造了一个由无平方因子自然数参数化的移位卷积和，其渐近增长可判别该数是否为同余数，从而为同余数问题提供新的研究路径。
We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy, Chen and other binary partitions.
Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n >= 1 over k. Then Hilbert's Tenth Problem for L is undecidable. In particular, Hilbert's Tenth Problem for function fields of varieties over number fields of dimension >= 1 is undecidable.
We improve a previous unconditional result about the asymptotic behavior of $\sum_{n\le x} r(n)r(n+m)$ with $r(n)$ the number of representations of $n$ as a sum of two squares when $m$ may vary with $x$.
The lecture, given at the ICM 2014 in Seoul, explores several problems of analytic number theory in the context of function fields over a finite field, where they can be approached by methods different than those of traditional analytic number theory. The resulting theorems can be used to check existing conjectures over the integers, and to generate new ones. Among the problems discussed are: Counting primes in short intervals and in arithmetic progressions; Chowla's conjecture on the autocorrelation of the Mobius function; and the additive divisor problem.
Comparative Prime Number Theory Problem List
本文整理了2024年UBC比较素数论研讨会与会者提出的问题清单，旨在推动该领域的研究与合作。
Large value estimates in number theory, harmonic analysis, and computer science
本文综述了数论、调和分析与计算机科学中的大值问题，梳理已知技巧与未解难题，并融合三个领域的视角。
In this paper, we study the asymptotic behaviour of the number of solutions $(m, n)\in \mathbb{N}^2$ to the inequality $ | α^n - β^m | \leq x $ when $x$ tends to infinity. Here $α, β$ are given multiplicatively independent complex numbers with $|α| > 1$ and $|β|>1$.
We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we assume the Riemann Hypothesis.
Goldbach's Problem in short intervals for numbers with a missing digit
本文在狄利克雷L函数无零点区域假设下，证明了短区间内几乎所有缺失一位数字的偶数都是哥德巴赫数。
We establish that the set of pairs $(α, β)$ of real numbers such that $$ \liminf_{q \to + \infty} q \cdot (\log q)^2 \cdot \Vert q α\Vert \cdot \Vert q β\Vert > 0, $$ where $\Vert \cdot \Vert$ denotes the distance to the nearest integer, has full Hausdorff dimension in $\R^2$. Our proof rests on a method introduced by Peres and Schlag, that we further apply to various Littlewood-type problems
An MSTD set is a finite set of integers with more sums than differences. It is proved that, for infinitely many positive integers $k$, there are infinitely many affinely inequivalent MSTD sets of cardinality $k$. There are several related open problems.
Let $\mathbb{N}_0$ be a class of natural numbers whose binary expansions contain even numbers of ones. Goldbach's problem in numbers of class $\mathbb{N}_0$ is solved.
The famous open problem of finding positive integer solutions to $a^5 + b^5 = c^5 + d^5$ is considered, and related solutions are found in two distinct settings: firstly, where $a$ and $b$ are both positive integers with $c$ and $d$ both Gaussian integers; secondly, where all of $a$, $b$, $c$, and $d$ are Gaussian integers.
For a positive integer $h$ and a subset $A$ of a given finite abelian group, we let $hA$, $h \hat{\;} A$, and $h_{\pm}A$ denote the $h$-fold sumset, restricted sumset, and signed sumset of $A$, respectively. Here we review some of what is known and not yet known about the minimum sizes of these three types of sumsets, as well as their corresponding critical numbers. In particular, we discuss several new open direct and inverse problems.
In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using covering systems and the theory of cyclotomic polynomials, the following theorem is proved: for any integer $m>1$, there are infinitely many integers $k$ satisfying $k\not\equiv-1\!\pmod{q}$ for any prime number $q|(m-1)$, such that for any positive integer $n$, $km^n+1$ is a composite number. These positive integers $k$ are called "Sierpinski numbers based $m$".…
For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. In this paper, for a sequence of integers $B=\{1<b_1<b_2<\cdots\}$ and $3b_1+5\leq b_2\leq 6b_1+10$, we determine the critical value for $b_3$ such that there exists an infinite sequence $A$ of positive integers for which $P(A)=\mathbb{N}\setminus B$. This result shows that we partially solve the problem of Fang and Fang [`On an inverse problem in additive number theory', Acta Math. Hungar. 158(2019), 36-39].
Let $ \{F_n\}_{n\ge 0} $ be the sequence of Fibonacci numbers and let $p$ be a prime. For an integer $c$ we write $m_{F,p}(c)$ for the number of distinct representations of $c$ as $F_k-p^\ell$ with $k\ge 2$ and $\ell\ge 0$. We prove that $m_{F,p}(c)\le 4$.
The current work revisits the results of L.F. Meyers and R. See in [3], and presents the census-taker problem as a motivation to introduce the beautiful theory of numbers.
We survey Weber's class number problem and its variants in the spirit of arithmetic topology; we recollect some history, present a relation to certain units and generalized Pell's equation, and overview a study of the $p$-adic limits of class numbers in $\mathbb{Z}_p$-towers together with numerical investigation for knots and elliptic curves.
We consider applications of Subset Product Problem (SPP) in number theory and cryptography. We obtain a probabilistic algorithm that attack SPP and we analyze it with respect time/space complexity and success probability. In fact we provide an application to the problem of finding Carmichael numbers and an attack to Naccache-Stern knapsack cryptosystem, where we update previous results.
Assuming the 2-adic Iwasawa main conjecture, we find all CM fields with higher relative class number at most 16: there are at least 31 and at most 34 such fields, and exactly one is not abelian.
Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.
Diversity, equity, and inclusion for problems in additive number theory
本文探讨加法数论中较少关注的问题，强调其在加法经典成果中的重要性，尤其关注有限整数集的和集大小及和集交集的算术结构问题。
This is a survey of open problems in different parts of combinatorial and additive number theory. The paper is based on lectures at the Centre de Recerca Matematica in Barcelona on January 23 and January 25, 2008.
The inverse problem for the Steiner--Wiener index via additive number theory
本文证明对于任意k≥2，足够大的数均可作为图的Steiner-Wienerk指数出现，利用加性数论方法解决逆问题。
Problems in additive number theory, VI: Sizes of sumsets
本文探讨整数及有序阿贝尔群有限子集的和集与受限和集的基数可能取值问题。
For an elliptic curve $E$ over $K$, the Birch and Swinnerton-Dyer conjecture predicts that the rank of Mordell-Weil group $E(K)$ is equal to the order of the zero of $L(E_{/ K},s)$ at $s=1$. In this paper, we shall give a proof for elliptic curves with complex multiplications. The key method of the proof is to reduce the Galois action of infinite order on the Tate module of an elliptic curve to that of finite order by using the $p$-adic Hodge theory. As a corollary, we can determine whether a given natural number is a congruent number (congruent number problem). This problem is one of the olde…
In the paper we obtain some new applications of well--known W. Rudin's theorem concerning lacunary series to problems of combinatorial number theory. We generalize a result of M.-C. Chang on L_2 (L)-norm of Fourier coefficients of a set (here L is a dissociated set), and prove a dual version of the theorem. Our main instrument is computing of eigenvalues of some operators.
Let $\mathbb{Z}^{ab}$ be the ring of integers of $\mathbb{Q}^{ab}$, the maximal abelian extension of $\mathbb{Q}$. We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients, has a solution in $\mathbb{Z}^{ab}$ modulo every rational prime.
We consider several questions about restriction of representations of classical and metaplectic groups over local and global fields to subgroups, extending considerably the scope of the earlier work on $SO(n),SO(n-1)$. This includes Bessel and Fourier-Jacobi models too. We formulate several conjectures about these restriction problems involving root numbers of symplectic representations in the local case, and central critical L-value in the global case. Along the way we prove several results both in number theory and representation theory.
For an operator-differential equation of the form $y^{(m)}(z) = Ay(z)$, where $A$ is a closed linear operator on a Banach space over the the field of $p$-adic numbers, the necessary and sufficient conditions on initial data for the Cauchy problem to be well-posed in the class of locally analytic vector-valued functions are given. The result is illustrated by $p$-adic partial differential equations.
By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$ (period number) in their paper,another is the problem about existence of bounded coefficients of continued fraction expansion of transcendental number.Thus we show a new approach to mathematical problems in the non-logical discipline.Futhermore,we show that resource-bounded Kolmogorov Complexity and computational complexity can at least provide tips or principl…
We present new theoretical algorithms that sums the n-ary comparators output in order to get the permutation indices in order to sort a sequence. By analysing the parallel ranking algorithm, we found that the special comparators number of elements it processes divide the number of elements to be sorted. Using the divide and conquer method, we can express the sorting problem into summing output of comparators taking a prime number of elements, given that this prime number divides the initial disordered sequence length. The number of sums is directly related to the Maundy cake problem. Furthermo…
The aim of this paper is threefold: a) Finding new direct and inverse results in the additive number theory concerning Minkowski sums of dilates. b) Finding a connection between the above results and some direct and inverse problems in the theory of Baumslag-Solitar (non-abelian) groups. c) Solving certain inverse problems in Baumslag-Solitar groups or monoids, assuming appropriate small doubling properties.
We consider the complexity of integer base expansions of algebraic irrational numbers from a computational point of view. We show that the Hartmanis--Stearns problem can be solved in a satisfactory way for the class of multistack machines. In this direction, our main result is that the base-$b$ expansion of an algebraic irrational real number cannot be generated by a deterministic pushdown automaton. We also confirm an old claim of Cobham proving that such numbers cannot be generated by a tag machine with dilation factor larger than one.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。