Results 1 to 10 of about 513 (76)

Goldbach partitions and norms of cusp forms

open access: yesJournal of Numerical Analysis and Approximation Theory, 2019
An integral formula for the Goldbach partitions requires uniform convergence of a complex exponential sum. The dependence of the coefficients of the series is found to be bounded by that of cusp forms.
Simon Brian Davis
doaj   +8 more sources

A Note on Goldbach Partitions of Large Even Integers [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2015
Let $\Sigma_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We show that $\mid\Sigma_{2n}\mid\sim 2n^2/\log^2{n}$ as $n\to\infty$. We also assume that a partition is selected uniformly at
Mutafchiev, Ljuben
core   +5 more sources

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

open access: yesElectronic 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   +3 more sources

Vectorizing and distributing number‐theoretic transform to count Goldbach partitions on Arm‐based supercomputers

open access: yesConcurrency Computation Practice and Experience, 2023
SummaryIn this article, we explore the usage of scalable vector extension (SVE) to vectorize number‐theoretic transforms (NTTs). In particular, we show that 64‐bit modular arithmetic operations, including modular multiplication, can be efficiently implemented with SVE instructions.
Ricardo Jesus, Michele Weiland
exaly   +3 more sources

On the existence of a non-zero lower bound for the number of Goldbach partitions of an even integer [PDF]

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2004
The Goldbach partitions of an even number, given by the sums of two prime addends, form the nonempty set for all integers 2n with 2≤n≤2×1014. It will be shown how to determine by the method of induction the existence of a non-zero lower bound for the
Simon Davis
doaj   +3 more sources

Conditional Proof of the Collatz Conjecture via Goldbach Partitions

open access: yes
Conditional Proof of the Collatz Conjecture via Goldbach ...
exaly   +3 more sources

Complex Circles of Partition and the Asymptotic Binary Goldbach Conjecture

open access: yes, 2022
In this work, we continue the complex circle of partition development that was started in our foundational study [3]. With regard to commandits embedding circle, we define interior and exterior points. On this foundation, we expand the concept of point density, established in [2], to include complex circles of partition.
Theophilus Agama, Berndt Gensel
openaire   +1 more source

EXPLORING SOME NEW IDEAS ON SMARANDACHE TYPE SETS, FUNCTIONS AND SEQUENCES [PDF]

open access: yes, 1996
In this article I have defined a number of SMARANDACHE type sets ,sequences which I found very interesting. The problems and conjectures proposed would give food for thought and would pave ways for more work in this ...
Murthy, A.
core   +1 more source

Partition games [PDF]

open access: yes, 2020
We introduce CUT, the class of 2-player partition games. These are NIM type games, played on a finite number of heaps of beans. The rules are given by a set of positive integers, which specifies the number of allowed splits a player can perform on a ...
Dailly, Antoine   +3 more
core   +2 more sources

Empirical Significance, Predictive Power, and Explication [PDF]

open access: yes, 2017
Criteria of empirical significance are supposed to state conditions under which (putative) reference to an unobservable object or property is “empirically meaningful.” The intended kind of empirical meaningfulness should be necessary for admissibility ...
Surovell, Jonathan/R
core   +1 more source

Home - About - Disclaimer - Privacy