中文
相关论文

相关论文: Twin Primes and a Primality Test by Indivisibility

200 篇论文

The Frobenius primality test is based on the properties of the Frobenius automorphism of the quadratic extension of the residue field. Although it is probabilistic, we show that is "very rarely wrong". To date there are no counterexamples…

数论 · 数学 2020-11-16 Sergei Khashin

We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…

综合数学 · 数学 2019-01-01 Debayan Gupta , Mayuri Sridhar

Let $S\subseteq \mathbb{N}$ be a numerical semigroup with multiplicity $m$, embedding dimension $\nu$ and conductor $c=f+1=qm-\rho$ for some $q,\rho\in\mathbb{N}$ with $\rho<m$. Let Ap$(S,m) = \{w\_0<w_1 < \ldots < w_{m-1}\}$ be the Ap\'ery…

组合数学 · 数学 2016-10-30 Mariam Dhayni

We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.

组合数学 · 数学 2017-10-24 John Shareshian , Russ Woodroofe

While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…

数论 · 数学 2024-12-17 Claire Burrin , Matthew Issac

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

离散数学 · 计算机科学 2010-07-29 Zan Pan

The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown,…

数论 · 数学 2023-08-02 Juan Hernandez-Toro

This paper presents a detailed proof of the triality theorem for a class of fourth-order polynomial optimization problems. The method is based on linear algebra but it solves an open problem on the double-min duality left in 2003. Results…

最优化与控制 · 数学 2011-10-04 David Y Gao , Changzhi Wu

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

数论 · 数学 2024-09-10 Jon Grantham , Andrew Granville

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

组合数学 · 数学 2014-02-21 Shan-Shan Du , Hui-Qin Cao , Zhi-Wei Sun

We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most…

代数几何 · 数学 2020-05-20 Eduardo Ruíz Duarte , Marc Paul Noordman

We construct closed forms that generate with repetitions all Mersenne primes, respectively all Fermat primes, all twin-prime pairs and all Sophie Germain primes. Also, we construct closed forms that count all Mersenne primes between $0$ and…

数论 · 数学 2025-12-02 Mihai Prunescu

Triality is a classical notion in geometry that arose in the context of the Lie groups of type $D_4$. Another notion of triality, Wilson triality, appears in the context of reflexible maps. We build a bridge between these two notions,…

群论 · 数学 2022-09-12 Dimitri Leemans , Klara Stokes

Extending previous work of the author, we compute the Wilson quotient modulo $p^5$ and $p^6$, and equivalently $(p-1)!$ modulo $p^6$ and $p^7$, respectively. Further, we determine some power sums of the Fermat quotients up to modulo $p^6$.…

数论 · 数学 2025-10-31 Bernd C. Kellner

In this paper, using the well known fact that the series of reciprocals of primes diverges, we obtain a general inequality for gaps of consecutive primes that holds for infinitely many primes. As it is shown the key ingredient for this…

数论 · 数学 2017-12-14 Douglas Azevedo

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

形式语言与自动机理论 · 计算机科学 2009-07-06 M. Rigo , L. Waxweiler

Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…

数论 · 数学 2012-03-26 H. J. Weber

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

数论 · 数学 2025-08-12 Soumya Bhattacharya , Habibur Rahaman

In this paper, we prove that there are infinitely many primes of the form $\ell^2 - \ell m + m^2$ such that $2\ell - m$ is also prime. To prove this, we follow along the lines of the work of Fouvry and Iwaniec (1997) who showed that there…

数论 · 数学 2016-09-30 Mayank Pandey

The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…

环与代数 · 数学 2012-12-24 Wolfram Bentz , Luis Sequeira