Results 81 to 90 of about 61,568 (111)

Set Partitions in R [PDF]

Robin K. S. Hankin, Luke J. West
core  

Goldbach 775 Jahre ; 1218 - 1993 ; Geschehnisse, Ereignisse, Veränderungen

, 1993
Geschichts- und Heimatverein (Goldbach, Aschaffenburg), Karpf, Hugo   +1 more
core  

On the Distribution of the Number of Goldbach Partitions of a Randomly Chosen Positive Even Integer [PDF]

Electronic Notes in Discrete Mathematics, 2016
Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let $Q(2k)$ be the number of all Goldbach partitions of the number $2k$.
Ljuben Mutafchiev
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Computing the Number of Goldbach Partitions up to 5 108

Lecture Notes in Computer Science, 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.
exaly   +3 more sources

Deep learning-based approximation of Goldbach partition function

Discrete Mathematics, Algorithms and Applications, 2021
Goldbach’s conjecture is one of the oldest and famous unproved problems in number theory. Using a deep learning model, we obtain an approximation of the Goldbach partition function, which counts the number of ways of representing an even number greater than 4 as a sum of two primes.
openaire   +3 more sources

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

Study of Structured Primes in Goldbach Partitions

Annual International Conference on Computational Mathematics, Computational Geometry & Statistics (CMCGS 2012), 2012
exaly   +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.
Simon Davis
exaly   +2 more sources

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

The Integration VLSI Journal, 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.
exaly   +2 more sources

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

Lecture Notes in Computer Science, 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.
Yannick Saouter
exaly   +2 more sources