I did a BFI approach of primes and a bunch of bell curves.

[HHSM]

I have approximated Goldbach's Problem (that all even numbers above 2 can be constructed with 2 primes) for a sequence from 4 to 100 using brute force and ignorance. Jokes aside, I used the Sieve of Eratosthenes and wrote down the results on the sum table below. In addition, I decided to plot the sum's numbers on two planes. The first plots formed an exponential curve, with a bell curve in the number 79. For the second plots, I took the values of the second numbers and plotted them as isolated points on the Y-axis, connecting them and smoothing the lines, forming bell curves.
2+2 =4
3+3 =6
5+3=8
5+5=10
5+7=12
7+7=14
13+3=16
13+5=18
17+3=20
19+3=22
19+5=24
23+3=26
23+5=28
23+7=30
29+3=32
29+5=34
29+7=36
31+7=38
37+3=40
37+5=42
37+7=44
43+3=46
43+5=48
47+3=50
47+5=52
47+7=54
53+3=56
53+5=58
53+7=60
59+3=62
59+5=64
59+7=66
61+7=68
67+3=70
67+5=72
71+3=74
73+3=76
73+5=78
73+7=80
79+3=82
79+5=84
79+7=86
83+5=88
83+7=90
89+3=92
89+5=94
89+7=96
79+19=98
97+3=100

Edited November 3 by HHSM
some parts of the sum table was wrong

[OceanBreeze]

Nice work. Now, just for fun, try to consider other possibilities:

10 = 5 + 5 = 3 + 7

14 = 7 + 7 = 3 + 11

16 = 13 + 3 = 5 + 11

18 = 13 + 5 = 11 + 7

20 = 17 + 3 = 13 + 7

22 = 19 + 3 = 11 + 11 etc….

It gets more interesting as you find more possible combinations.