Direction of Goldbach Partitions

  • Context: Graduate 
  • Thread starter Thread starter Paul Mackenzie
  • Start date Start date
  • Tags Tags
    Direction partitions
Click For Summary
SUMMARY

This discussion focuses on the analysis of Goldbach partitions, specifically examining the direction of these partitions as the even number 2N increases. A function f(2N) was defined to categorize the differences in the number of partitions G[2N] and G[2N-2]. The generated sequence from 2N = 10 to 2N = 75398 revealed patterns in subsequences, with notable counts for types such as x,1,x (5563 occurrences) and x,-1,x (7003 occurrences). The conversation also explores the potential similarity of these patterns to sequences derived from Hardy-Littlewood's equation for Goldbach partitions.

PREREQUISITES
  • Understanding of Goldbach's conjecture and partitions
  • Familiarity with sequences and subsequences in mathematics
  • Knowledge of Hardy-Littlewood's equation
  • Basic programming skills for generating and analyzing sequences
NEXT STEPS
  • Research the properties of Goldbach partitions and their distributions
  • Explore Hardy-Littlewood's equation and its implications on partition theory
  • Learn about histogram analysis in mathematical sequences
  • Investigate the significance of subsequence patterns in number theory
USEFUL FOR

Mathematicians, number theorists, and researchers interested in partition theory and the properties of Goldbach partitions.

Paul Mackenzie
Messages
16
Reaction score
0
I have been investigating goldbach partitions for some time.
One interesting observation I have been able to determine is concerning the "direction" of the goldbach partitions whether they are increasing or decreasing as 2N increases.

To get an idea of this I constructed a function f(2N) where

f(2N) = 1 if G[2N] - G[2N-2] > 0
f(2N) = 0 if G[2N] - G[2N-2] = 0
f(2N) = -1 if G[2N] - G[2N-2] < 0


where G[2N] is the number of partitions for the even number 2N.

I then generated a sequence of numbers f(2N) beginning at 2N = 10 and finishing at 2N=75398
[arbitrarily selected]. The sequence is then:

{1,1,-1,1,1,-1,-1,1,1,-1,-1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,1,-1,1,1,-1,1,1,-1,...}


I ran a program to determine a histogram of the number of occurences of the subsequences of the following form


histogram

subsequence type
No. of Occurences

x,1,x
5563

x,-1,x
7003

x,1,1,x
7003

x,-1,-1,x
5562

x,1,1,1,x
0

x,-1,-1,-1,x
1

x,0,x
0





I have been trying to work out a descriptive name for this sequence. Any suggestions?

The question then arises will a sequence generated from Hardy-Littlewoods equation
for Goldbach partions be similar?

Also , any comments on the histogram? Why the asymmetric nature ?

And why only these subsequences? I would have thought there would have been longer runs. Any ideas?

Paul
 
Physics news on Phys.org
What exactly does 'x,1,x' mean? Are the two x's the same or independent? Either way, the count seems much too low. How can it be less than x,1,1,x?
 
Hi Haruspex:

I am counting the number of consecutive runs of similar digits in the sequence. So the run x1x refers to either the subsequence 0,1,0, or 0,1,-1 or -1,1,0 or -1,1,-1.
As another example the consecutive run of two positive ones viz x,1,1,x refers to the subsequences -1,1,1,0 or -1,1,1,-1 or 0,1,1,0 or 0,1,1,-1.

All the counts are mutually exclusive, and add up to the correct number of digits [give or take one or two, as I am having problems with the start and end of the sequence]

But the question remains why this particular pattern.

Kind Regards
Paul
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 26 ·
Replies
26
Views
977
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
651
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K