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}$
Month: November 2024
A Conjecture for a Perrin-like sequence
Conjecture Let $ W(k) $ be defined as:$$W(0) = 1, \quad W(1) = 0, \quad W(2) = 2,$$and for $ k > 2 $, recursively by:$$W(k) = 3W(k-2) + W(k-3).$$ Then, for $ n > 0 $ such that $ n \equiv \pm 2, \pm 4 \pmod{9} $, $ n $ is prime if and… Continue reading A Conjecture for a Perrin-like sequence
Test results for 1e12 to 2e12
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}$
New repository on Github for trying out my code
I’ve created a software repository on Github hosting the files in my project: cubicFrobenius. Here are some commands in Linux bash that you may find helpful:
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
Detailed prime test statistics
Below, we have a sample report using the most up to date version of the program:
cos(z)=0 implies z is real // ChatGPT’s solution
To determine whether $ \cos(z) = 0 $ implies that $ z $ must be real, we analyze the equation using the definition of cosine in the complex domain. Key Idea: Using the Complex Definition of Cosine The cosine function for a complex number $ z = x + iy $ (where $ x, y… Continue reading cos(z)=0 implies z is real // ChatGPT’s solution
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
Pari/gp functions for isfrob3select Nov 11
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
What is a cubic Frobenius primality test?
It’s a test that any prime number passes, but that only a few composite numbers pass. The test is made up of three congruences that are proved using basic Galois Theory. The setup is an irreducible polynomial $f$ over $\mathbb F_{p}$ with $f = X^3 – rX – s$, and $r>0$ $s>0$. Additionally, we require… Continue reading What is a cubic Frobenius primality test?
Updated C program to count primes using a cubic Frobenius test
Multithreaded C program to count primes using a cubic Frobenius test
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
C program that counts primes using a cubic Frobenius primality test
A question on polynomial irreducibility over finite fields
Let $f$ be the polynomial $X^3 -rX -s$, where $r>0$ and $s>0$ and let $\Delta$ be its discriminant. Suppose that $\Delta$ is a square, and that $p$ and $q$ are primes such that $\Delta$ divides $p-q$. Under those conditions, is it always the case that $f$ is irreducible in $F_{p}$ iff f is irreducible in… Continue reading A question on polynomial irreducibility over finite fields
Latest PARI/gp code for the cubic Frobenius primality test
Update on the cubic Frobenius test
I’m now using the polynomial $f = X^3 – 3X -1$. Given a number to test $p$, things are good if $f$ is irreducible over $F_{p}$. I’m not too sure why this is so, but it’s also the case for the standard quadratic Frobenius test, that one works in proper extensions of $F_{p}$. Empirically, the… Continue reading Update on the cubic Frobenius test
Question in Galois Theory and Finite Fields
Let $f = X^3 – 3X – 1$ and let $p$ be a prime such that $f$ is irreducible over $F_{p}$. Let $L$ be a splitting field of $f$ over $F_{p}$. For $k>=0$, let $V_{k} = \alpha^k + \beta^k + \gamma^k$ , where $alpha$, $beta$ and $gamma$ are the three roots of $f$ over $L$.… Continue reading Question in Galois Theory and Finite Fields
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$
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$
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
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
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)
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
Symmetric polynomials and Galois Theory applied to primality testing (work in progress)
Memorandum: Leveraging Symmetric Polynomials and Galois Theory for Primality Testing To: Mathematics Enthusiasts and ScholarsFrom: [Your Name]Date: [Current Date]Subject: Theoretical Framework for Primality Testing Using Symmetric Polynomials and Galois Theory In the quest to develop robust primality tests, leveraging foundational algebraic structures offers profound insights and efficient methodologies. This memorandum elucidates a theoretical framework that… Continue reading Symmetric polynomials and Galois Theory applied to primality testing (work in progress)