I know that one of Goldbach's conjectures is that every even number is the sum of 2 primes. So, I was wondering if there was a definite, largest prime number ever possible. I know that as a number gets larger, there are more numbers that can be tried to divide it (At least I think so), and I was wondering if there was a point where numbers got so large that there is a single highest prime number, and there can be no higher number that can't be divided by itself or 1. So, we can probably do something with this. Doing so, we take an obscenely large number, much larger than the largest prime, say 20 times larger, for good measure, and then, we would not be able to make that even number by adding 2 primes to it, it would be impossible, if there is a largest prime. If this is true, then I think that the version of Goldbach's conjecture stated will be disproven. Please forgive me if anyone asked this before, I have not taken any classes on number theory yet, I only just finished Algebra 1 in high school, so I o not know much about it. But it just sparked in my mind, and I thought I might give a shot at seeing what people think about it. And, forgive me if I got anything wrong, though I don't think I did, since most of what I said were mostly questions.