Results 111 to 120 of about 171,915 (143)

Goldbach partitions and sequences

Resonance, 2014
Properties of Goldbach partitions of numbers, as sums of primes, are presented and their potential applications to cryptography are described. The sequence of the number of partitions has excellent randomness properties. Goldbach partitions can be used to create ellipses and circles on the number line and they can also be harnessed for cryptographic ...
openaire   +1 more source

Computing the Number of Goldbach Partitions up to 5 108

2000
Computing the number of Goldbach partitions $$g(n) = \#\{(p,q) | n = p + q, p \leq ~q\}$$ of all even numbers n up to a given limit can be done by a very simple, but space-demanding sequential procedure. This work describes a distributed implementation for computing the number of partitions with minimal space requirements.
openaire   +2 more sources

A recursion relation for the number of Goldbach partitions of an even integer

Journal of Discrete Mathematical Sciences and Cryptography
The contour integral representation of the number of Goldbach partitions of an even integer, G(n), is extended to an integral with a support function that equals a linear combination of integers {G(m)}. A support function is found such that there is a nontrivial integral relation relating number of Goldbach partitions of n and m < n.
openaire   +1 more source

An FPGA systolic array using pseudo-random bit generators for computing Goldbach partitions

Integration, 2000
Summary: A linear systolic array of 256 cells for computing the Goldbach partitions has been designed and implemented on the FPGA PeRLe-1 platform. Fast computation is achieved using a counter based on a pseudo-random bit generator. Beyond this application we show that FPGA technology tends to promote such applications.
openaire   +1 more source

Computing Goldbach partitions using pseudo-random bit generator operators on an FPGA systolic array

1998
Calculating the binary Goldbach partitions for the first 128× 106 numbers represents weeks of computation with the fastest microprocessors. This paper describes an FPGA systolic implementation for reducing the execution time. High clock frequency is achieved using operators based on pseudo-random bit generator.
Dominique Lavenier, Yannick Saouter
openaire   +1 more source

Phenomenological Evidence of GUE Statistics and Thermodynamic Stability in Goldbach Partitions

This preprint presents a computational and phenomenological analysis of Goldbach's Conjecture through the combined lenses of spectral theory (GUE random matrix statistics) and statistical mechanics (thermodynamic entropy). Using an integral-refined Hardy–Littlewood heuristic with explicit Singular Series computation, we achieve convergence ratios of ≈1.
openaire   +1 more source

Exceptional zeros and the Goldbach problem

Journal of Number Theory, 2022
Daniel Goldston, Ade Irma Suriajaya, John Friedlander   +2 more
exaly  

On the ergodic Waring–Goldbach problem

Journal of Functional Analysis, 2022
Kevin Hughes, Angel Kumchev, Brian Cook   +2 more
exaly  

Study of Structured Primes in Goldbach Partitions

Annual International Conference on Computational Mathematics, Computational Geometry & Statistics (CMCGS 2012), 2012
openaire   +1 more source

An exact procedure for determining integers to be used in Goldbach partition and proof of Strong Goldbach conjecture

2021
openaire   +1 more source