中文
相关论文

相关论文: Friends of 12

200 篇论文

Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…

数论 · 数学 2017-02-17 S. I. Dimitrov

Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.

群论 · 数学 2017-02-10 Bettina Eick

Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))^2$, then there exist odd (not necessarily distinct)…

数论 · 数学 2021-09-22 Tomohiro Yamada

Heath-Brown proved that for a positive proportion of integers $n$, $n^3+2$ has a prime factor larger than $n^{1+c}$ with $c=10^{-303}$. We generalize this result to arbitrary monic irreducible cubic polynomial of $\mathbb{Z}[x]$ with $c$…

数论 · 数学 2026-02-05 Ivan Ermoshin

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

数论 · 数学 2020-03-03 Zhi-Wei Sun

Bertrand's postulate establishes that for all positive integers $n>1$ there exists a prime number between $n$ and $2n$. We consider a generalization of this theorem as: for integers $n\geq k\geq 2$ is there a prime number between $kn$ and…

数论 · 数学 2017-06-06 Kyle D. Balliet

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

数论 · 数学 2017-07-11 Doyon Kim

In this paper we construct a cover {a_s(mod n_s)}_{s=1}^k of Z with odd moduli such that there are distinct primes p_1,...,p_k dividing 2^{n_1}-1,...,2^{n_k}-1 respectively. Using this cover we show that for any positive integer m divisible…

数论 · 数学 2008-11-29 Ke-Jian Wu , Zhi-Wei Sun

In this paper we use the theory of modular forms to find formulas for the number of representations of a positive integer by certain class of quadratic forms in eight variables, viz., forms of the form $a_1x_1^2 + a_2 x_2^2 + a_3 x_3^2 +…

数论 · 数学 2016-07-19 B. Ramakrishnan , Brundaban Sahu , Anup Kumar Singh

Let $\mathbb{Z}_n$ denote the ring of integers modulo $n$. In this paper we consider two extremal problems on permutations of $\mathbb{Z}_n$, namely, the maximum size of a collection of permutations such that the sum of any two distinct…

组合数学 · 数学 2014-02-18 L. Sunil Chandran , Deepak Rajendraprasad , Nitin Singh

Assume $x,\ y,\ n$ are positive integers and $n$ is odd. In this note, we show that the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{x^{2}-y^{n}})$ is divisible by $n$ for fixed $x, n$ if $\gcd(2x,y)=1$ and $y>C$ where…

数论 · 数学 2024-06-11 Yi Ouyang , Qimin Song

We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $\pm 1$ and decide which of these graphs are determined by their spectrum. This includes the so-called friendship graphs,…

组合数学 · 数学 2013-10-25 Sebastian M. Cioabă , Willem H. Haemers , Jason Vermette , Wiseley Wong

Let $B(m, n)$ be the number of ways to colour a $2m \times 2n$ grid in black and white so that, in each row and each column, half of the cells are white and half are black. Bhattacharya conjectured that the exponent of $2$ in the prime…

组合数学 · 数学 2025-05-01 Nikolai Beluhov

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

数论 · 数学 2023-01-24 Reese Scott , Robert Styer

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

数论 · 数学 2012-09-20 Zhi-Wei Sun

We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…

组合数学 · 数学 2011-03-04 Christiaan E. van de Woestijne

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

计算机科学中的逻辑 · 计算机科学 2015-09-22 John Cowles , Ruben Gamboa

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

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

数论 · 数学 2010-06-29 Siu-lun Alan Lee

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

数论 · 数学 2016-03-17 Yan Kun , Li Hou Biao