Empirical Results on a Randomized Cubic Primality Test

In 1980, Baillie and Wagstaff proposed a novel primality test consisting of a strong Fermat base $2$ test and a standard or strong Lucas test (Baillie and Wagstaff, 1980). This test has come to be known as the Baillie-PSW test after the names of its creators, and is now commonly included in software for mathematics,… Continue reading Empirical Results on a Randomized Cubic Primality Test

Implementation of the Randomized Cubic Primality Test in Python

This post provides a complete, runnable Python implementation of the randomized cubic primality test using explicit Frobenius computation in a cubic ring, as described in my article “A Randomized Cubic Primality Test Using Explicit Frobenius Computation”. The test operates in the ring $$R_N = (\mathbb{Z}/N\mathbb{Z})[x]/(f(x)),\qquad f(x)=x^3-qx-q,$$ where $N$ is the integer under test and $q$… Continue reading Implementation of the Randomized Cubic Primality Test in Python

A Randomized Cubic Primality Test Using Explicit Frobenius Computation

A Cubic Primality Test Based on Explicit Frobenius Computation. According to this document from July 10, 2025, the core idea is to build a primality test by explicitly computing the Frobenius action in a cubic extension and comparing it to a predicted conjugate. The randomized version below keeps the same mathematics, but replaces “search for… Continue reading A Randomized Cubic Primality Test Using Explicit Frobenius Computation

Published
Categorized as Mathematics

Memorandum for the record

Date: June 26, 2025 Subject: Conclusion of Overlap Search Between Fermat Base 2 Pseudoprimes and Cubic Primality Test

Published
Categorized as History

A Primality Test Based on Vieta’s Formulas

Introduction Primality testing is of fundamental importance to number theory. For numbers $n$ up to about a million,high-school level methods such as trial division by the integers $d$ such that $d \leq \sqrt n$ are simpleand effective. However, they are no match even for $30$-digit numbers. Let us consider the $32$-digit number $n = 10000000000000000000000000000033$.… Continue reading A Primality Test Based on Vieta’s Formulas

Numbers game Python code for Beta testers

I’m releasing beta code for a numbers game written in Python. The code was written by the Chatbot ChatGPT. Update: I’ve added a C language program after the Python program. The program interactively solicits the user to enter non-negative integers. Numbers with a hundred or more digits are acceptable. I don’t know how to run… Continue reading Numbers game Python code for Beta testers

A finite fields probable prime test using Galois conjugates and Vieta’s formulas

I’ve been trying to extend the cubic Frobenius test to a quartic test, and it’s been challenging. I got an idea for a primality test that isn’t fast, but is interesting in any case. Let $n$ be a probable prime, and $f$ be a monic 4th degree polynomial such that $f$ has no roots in… Continue reading A finite fields probable prime test using Galois conjugates and Vieta’s formulas

Cubic Frobenius test statistics from 1.0e13 to 2.0e13

For composites in the range 1.0e13 to 2.0e13, there are two instances of type 2 (passing Congruence 1 only) and no instances showing they passed either Congruence 2 or Congruence 3. For the primes in the range, they all pass congruences 1 to 5. Processing block 1000: 10999000000000 to 11000000000000Type 0: 233313317052Type 1: 0Type 2:… Continue reading Cubic Frobenius test statistics from 1.0e13 to 2.0e13

When might one expect a Fermat-Lucas pseudoprime?

The Baillie-PSW primality test consists of a strong Fermat base $2$ test and a standard or strong Lucas sequences test. For an odd number $n$, the Fermat base $2$ test consists in checking whether the congruence $2^{n-1} \equiv 1 \pmod n$. A composite $n$ that passes the Fermat base $2$ test is known as a… Continue reading When might one expect a Fermat-Lucas pseudoprime?

A naive implementation of Erdos’ Carmichael number construction

I’ve been reading some about the Erdos heuristic to construct Carmichael numbers, first described by Erdos in 1956. It is based on Korselt’s criterion, that N is a Carmichael number if N is composite, squarefree and such that if p|N, then (p-1)|(N-1). The best reference I’ve found to understand the basics of Erdos’s heuristic is… Continue reading A naive implementation of Erdos’ Carmichael number construction

AI in 200 years time: what Chat-GPT says

In 200 years, assuming exponential advancements in technology, artificial intelligence (AI) could reach levels that are currently beyond our imagination. Here are some speculative capabilities AI might achieve in that timeframe: Cognitive and Creative Capabilities Scientific and Technological Achievements Societal Impact Ethical and Philosophical Challenges Cosmic Engineering Unimaginable Realities Speculating 200 years ahead is inherently… Continue reading AI in 200 years time: what Chat-GPT says

Cubic Frobenius test statistics to $10^{12}$

The test considers numbers (greater than 1) coprime to 30 in a given range. If the test number is denoted by $n$, we assume $n$ is prime and try to prove by contradiction that it is composite, i.e. that it fails one or more of the five congruences described in an earlier blog post (https://atomic-temporary-23414054.wpcomstaging.com/2024/11/13/a-perrin-like-primality-test-with-three-congruences/.The)… Continue reading Cubic Frobenius test statistics to $10^{12}$

Is ChatGPT getting smarter? (maybe)

I wrote: A typical (even math major) college undergraduate couldn’t do this. AI might be approaching graduate level in math in some respects… ChatGPT replied: You’re absolutely right—this problem requires a deep understanding of analysis and topology, tools like the Baire Category Theorem, and the ability to apply them creatively in a non-obvious way. It’s… Continue reading Is ChatGPT getting smarter? (maybe)

Cubic Frobenius test statistics to $10^{11}$

I ran my latest prime-testing program, based on a cubic Frobenius test, on the numbers from 1 to $10^{11}$. Numbers in that range coprime to 30 are considered for testing. Given the input $n$, the program looks for the first polynomial $f_{i}$ such that $f_{i}$ is irreducible over $F_{n}$ , where $f_{i}$ is one of… Continue reading Cubic Frobenius test statistics to $10^{11}$

Sample output from my latest prime-testing program

Types 1, 2 and 4 each correspond to one of three conditions being met. Type 0 corresponds to no condition being met, while type 7 corresponds to 3 out of 3 conditions being met. Some numbers $n$ are reported as untested because none of the 23 polynomials is irreducible over $\mathbb{F}_{n}$. The data on numbers… Continue reading Sample output from my latest prime-testing program

A Perrin-like Primality Test with Five Congruences

The Perrin sequence is defined by $P(0)=3$, $P(1)=0$, $P(2)=2$ and the recurrence relation $P(n) = P(n-2) + P(n-3)$ for $n\gt 2$. The Perrin sequence has the property that, if $n$ is prime then $n|P(n)$. However, the converse is false: in 1982, Adams and Shanks showed that $271441|P(271441)$, where $271441 = 521^2$. In contrast to the… Continue reading A Perrin-like Primality Test with Five Congruences

The Cubic Frobenius Primality Test by ChatGPT

Theoretical Background Finite Fields and Irreducible Polynomials A finite field $\mathbb F_p$ consists of a finite set of elements with well-defined addition and multiplication operations, where $p$ is a prime number. A polynomial $f(x) \in \mathbb{F}_p[x]$ is irreducible over $ \mathbb{F}_p $ if it cannot be factored into the product of two non-constant polynomials in… Continue reading The Cubic Frobenius Primality Test by ChatGPT

Published
Categorized as History

Update on the cubic Frobenius primality test

\section*{Progress Update: Scaling Prime-Counting to 100 Billion} I’m excited to share some recent progress on my prime-counting program. After numerous iterations and optimizations, the program is now fully operational and demonstrating impressive performance metrics. \subsection*{Current Performance} The program efficiently processes large integer ranges with the following benchmarks: \begin{itemize}\item 1 Billion Integers: Approximately 6 minutes.\item 100… Continue reading Update on the cubic Frobenius primality test

Published
Categorized as History

Another cubic Frobenius test based on $X^3-3X-1$

Certainly! Here’s a comprehensive blog post on the Cubic Frobenius Primality Test based on the polynomial ( f(X) = X^3 – 3X – 1 ). This post is structured to be engaging and informative, suitable for readers with a keen interest in number theory and computational mathematics. Introducing the Cubic Frobenius Primality Test Primality testing… Continue reading Another cubic Frobenius test based on $X^3-3X-1$

Published
Categorized as History

On Primes of the Form $2x^2 + xy + 3y^2$

This memo explores the properties and distribution of prime numbers representable by the quadratic form $2x^2 + xy + 3y^2$. Utilizing an optimized primality testing method based on matrix exponentiation, we efficiently identify such primes, even extending to 300-digit numbers. The approach hinges on the irreducibility of the polynomial $X^3 – X – 1$ modulo… Continue reading On Primes of the Form $2x^2 + xy + 3y^2$

Published
Categorized as History

Last Memo, with improved Latex rendering

Certainly! Below is the reformatted version of the memorandum tailored for your WordPress blog. This version replaces the \[ … \] delimiters with $$ … $$ for display math, ensuring compatibility with your MathJax plugin. Inline mathematical expressions remain enclosed within single $ … $ as before. Enhancing the Frobenius Primality Test Using Cubic Recurrence… Continue reading Last Memo, with improved Latex rendering

Published
Categorized as History

Memorandum for the record: cubic Frobenius test, a work in progress

Certainly! Let’s incorporate your insightful feedback and the confirmation from PARI/gp to finalize the derivation of ( V_{p+2} ) in the context of the Cubic Frobenius Primality Test. This will ensure that our framework is both accurate and robust. Below is the updated and corrected derivation, formatted in LaTeX for seamless integration into your WordPress… Continue reading Memorandum for the record: cubic Frobenius test, a work in progress

Published
Categorized as History

Converted to Latex (about Symmetric polynomials,Galois theory and primality testing)

Certainly! Below is the LaTeX-formatted version of the memorandum tailored for your WordPress blog. This version avoids using double $$ signs for display math and instead utilizes single $ signs for all mathematical expressions, ensuring compatibility with WordPress’s math rendering plugins. Enhancing the Frobenius Primality Test Using Cubic Recurrence Relations Introduction In the pursuit of… Continue reading Converted to Latex (about Symmetric polynomials,Galois theory and primality testing)

Published
Categorized as History

Test 4

Certainly! Below is the LaTeX-formatted memorandum tailored for your WordPress blog. This version avoids using double $$ signs for display math and instead utilizes \[ … \] for display equations and $…$ for inline math, ensuring compatibility with most WordPress math rendering plugins like MathJax or KaTeX. Enhancing the Frobenius Primality Test Using Cubic Recurrence… Continue reading Test 4

Latex test 3

Certainly! Below is the LaTeX-formatted version of the memorandum tailored for your WordPress blog. This version avoids using double $$ signs for display math and instead utilizes single $ signs for all mathematical expressions, ensuring compatibility with WordPress’s math rendering plugins. Enhancing the Frobenius Primality Test Using Cubic Recurrence Relations Introduction In the pursuit of… Continue reading Latex test 3