Results 61 to 70 of about 532 (94)

A novel and diverse family of filamentous DNA viruses associated with parasitic wasps. [PDF]

Virus Evol
Guinet B, Leobold M, Herniou EA, Bloin P, Burlet N, Bredlau J, Navratil V, Ravallec M, Uzbekov R, Kester K, Gundersen Rindal D, Drezen JM, Varaldi J, Bézier A.   +13 more
europepmc   +1 more source

Schur rings and non-symmetric association schemes on 64 vertices [PDF]

, 2008
Jørgensen, Leif Kjær
core  

An Exact Identity for the Twin Prime Counting Function Derived from Minimal Goldbach Partitions

Assuming the Goldbach conjecture, we establish a quantitative connection between the twin prime counting function $\pi_2(x)$ and the distribution of minimal primes in Goldbach decompositions of even integers. For each even integer $k \geq 4$, define $p(k)$ as the smallest prime $p$ such that $k - p$ is also prime.
openaire   +2 more sources

The Nedelchev Structural Law: Spectral Invariance and Dynamical Scaling in Goldbach-Partitioned Oscillator Networks

# The Nedelchev Structural Law: Prime Synchronization & Spectral Stability   This research dataset and software framework formalize the **Nedelchev Structural Law**, a fundamental discovery linking Additive Number Theory with the synchronization dynamics of non-linear systems.
  +6 more sources

Investigation of Several Parameters on Goldbach Partitions

, 2011
Özkan, Derya, İLGEN, BAHAR
openaire   +1 more source

Some implications on amorphic association schemes. [PDF]

Dam, E.R. van, Muzychuk, M.
core   +1 more source

Existence of Goldbach Partitions for Large Even Numbers under the 1/6 N Strong Constraint and a Rigorous Proof of the Order of Magnitude of the Goldbach Counting Function

This paper studies the counting function of even numbers expressed as sums of two primes. Using the 1/6N constraint and symmetric sieve method, we prove the discrete monotonicity of the counting function, which provides a new proof idea for Goldbach's Conjecture.
openaire   +1 more source

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   +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