Generating Primes Using Partitions

TL;DR

This paper introduces a novel method for generating large prime numbers by utilizing Goldbach partitions, which are then verified with primality tests like Miller Rabin or AKS.

Contribution

The paper proposes a new prime generation technique based on Goldbach partitions, combining partition theory with primality testing.

Findings

Method successfully generates candidate primes

Candidates are effectively tested with Miller Rabin or AKS

Potential for more efficient prime generation

Abstract

This paper presents a new technique of generating large prime numbers using a smaller one by employing Goldbach partitions. Experiments are presented showing how this method produces candidate prime numbers that are subsequently tested using either Miller Rabin or AKS primality tests.