arXiv 1003.21312010-03math.NT

The Uniform Primality Conjecture for the Twisted Fermat Cubic

Graham Everest, Ouamporn Phuksuwan, Shaun Stevens

备注：: 2 figures, 21 pages

英文摘要：

On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. We prove that the number of prime terms in the sequence is uniformly bounded. When the rational point is the image of another rational point under a certain 3-isogeny, all terms beyond the first fail to be primes.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Primality tests for Fermat numbers and 2^(2k+1)\pm2^(k+1)+1

Robert Denomme and Gordan Savin made a primality test for Fermat numbers 2^(2^k)+1 using elliptic curves. We propose another primality test using elliptic curves for Fermat numbers and also give primality tests for integers of the form 2^(2k+1)\pm2^(k+1)+1.

2009-12-10math.NT

Improved error bounds for the Fermat primality test on random inputs

We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier estimates in moderate ranges. For example, with random numbers to $2^{200}$, our results improve on prior estimates by close to 3 orders of magnitude.

2017-07-05math.NT

A LLT-like test for proving the primality of Fermat numbers

This paper provides a proof of a LLT-like test for Fermat numbers, based on the properties of Lucas Sequences and on the method of Lehmer.

2007-05-24math.HOmath.NT

Primality of numbers of the form $ap^{k}+1$

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's converse of Fermat's little theorem. This result was considerably improved by Henry Pocklington in 1914 when he showed that it's not necessary to know all the prime factors of $n-1$ in order to determine if $n$ is prime. In this paper we optimize Pocklington's primality test for integers of the form $ap^{k}+1$ where $p$ is prime, $a<p$, $k\ge 1$. An extensi…

2021-04-10math.NT

A new characterization of prime Fermat's numbers

We give a new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary arithmetic technical tools and it will be susceptible to open gates for revolutionary statement that all Fermat's numbers are all decomposable.

2021-04-10math.NT

Effective Primality Test for $p2^n+1$, $p$ prime, $n>1$

We develop a simple $O((\log n)^2)$ test as an extension of Proth's test for the primality for $p2^n+1$, $p>2^n$. This allows for the determination of large, non-Sierpinski primes $p$ and the smallest $n$ such that $p2^n+1$ is prime. If $p$ is a non-Sierpinski prime, then for all $n$ where $p2^n+1$ passes the initial test, $p2^n+1$ is prime with $3$ as a primitive root or is primover and divides the base $3$ Fermat Number, $GF(3,n-1)$. We determine the form the factors of any composite overpseudoprime that passes the initial test take by determining the form that factors of $GF(3,n-1)$ take.

2018-11-14math.NT

更多相关论文收起更多论文

$Kp^n+1$数的质数测试及安全质数和索菲·热尔曼质数的推广

A primality test for $Kp^n+1$ numbers and a generalization of Safe Primes and Sophie Germain Primes

Azhar University（阿兹哈尔大学）

本文对形式为$Kp^n+1$的整数推广了普罗特定理，提出了一种仅需一次模幂运算的质数测试方法，无需计算任何GCD。同时提供了两种测试以提高验证$Kp^n+1$数质数的可能性。作为这些测试的推论，我们给出了三个整数家族$N$，其质数性只能通过证明$a^{N-1} \equiv 1 \pmod N$（费马测试）来确认。还推广了安全质数，定义为$a$-安全质数，因其$N-1$具有与安全质数相同的大型质因数。我们讨论了这些数的分布问题，并提出了关于相关数$a$-索菲·热尔曼质数分布的猜想。

2022-07-25math.NT

Level lowering modulo prime powers and twisted Fermat equations

We discuss a clean level lowering theorem modulo prime powers for weight $2$ cusp forms. Furthermore, we illustrate how this can be used to completely solve certain twisted Fermat equations $ax^n+by^n+cz^n=0$.

2010-09-01math.NT

Strengthening the Baillie-PSW primality test

The Baillie-PSW primality test combines Fermat and Lucas probable prime tests. It reports that a number is either composite or probably prime. No odd composite integer has been reported to pass this combination of primality tests if the parameters are chosen in an appropriate way. Here, we describe a significant strengthening of this test that comes at almost no additional computational cost. This is achieved by including in the test what we call Lucas-V pseudoprimes, of which there are only five less than $10^{15}$.

2021-06-11cs.CRmath.NT

Perfect powers generated by the twisted Fermat cubic

On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. It is shown that there are finitely many perfect powers in such a sequence whose first term is greater than 1. Moreover, if the first term is divisible by 6 and the generating point is triple another rational point then there are no perfect powers in the sequence except possibly an lth power for some l dividing the order of 2 in the first term.

2011-02-22math.NT

Twisted Fermat curves over totally real fields

Let p be a prime number, F a totally real field such that [F(mu_p): F]=2 and [F:Q] is odd. For delta \in F^times, let [delta] denote its class in F^times/F^{times p}. In this paper, we show Main Theorem. There are infinitely many classes [delta]\in F^times/F^{times p} such that the twisted affine Fermat curves W_delta: X^p+Y^p=delta have no F-rational points.

2007-06-04math.NT

On the Classification and Algorithmic Analysis of Carmichael Numbers

In this paper, we study the properties of Carmichael numbers, false positives to several primality tests. We provide a classification for Carmichael numbers with a proportion of Fermat witnesses of less than 50%, based on if the smallest prime factor is greater than a determined lower bound. In addition, we conduct a Monte Carlo simulation as part of a probabilistic algorithm to detect if a given composite number is Carmichael. We modify this highly accurate algorithm with a deterministic primality test to create a novel, more efficient algorithm that differentiates between Carmichael numbers …

2017-02-26math.NT

扭曲费马商曲线的根数

Root numbers for twisted Fermat quotient curves

Mathematical inst. Tohoku Univ.（东北大学数学研究所）

本文基于扭曲费马商曲线的Hecke特征，推导出根数的显式公式，扩展了Stoll(2002)和Shu(2021)的研究成果。

2026-10-14math.NT

二次费马商曲线根数 II

Root numbers for twisted Fermat quotient curves II

Mathematical inst. Tohoku Univ.（东北大学数学研究所）

本文研究二次费马商曲线根数，放宽了技术假设ℓ∤rst的限制，计算了当ℓ^{N-1}‖r且ℓ∤stδ时的根数。

2026-10-15math.NT