Recent content by fibonacci235

Then I think I will name them Digital Primes.

I know that a prime number doesn't depend on its representation, but number theorists have names for different types of primes i.e. Mersenne primes, Irregular primes, Safe primes, and my personal favorite, Sexy primes. I just wanted to know if there was a name for this particular type of prime...

Is there a name for a prime number whose digits are all prime? The first several that I can think of are 2,3,5,7 and 23, 23 being the first double digit prime whose digits are all prime.

Ok, that does make more sense. Now, I understand why this is so hard to prove.

I have a question concerning Goldbach's Conjecture. First, it is easy to demonstrate that the sum of any two odd integers will always be even. For example, let an odd integer q=2k+1 and an odd integer p=2m+1 It then follows that q+p= 2(k+m+1) = 2n which is even. Now, it is true that any...

Ok, I need to apologize. I wasn't being careful enough, and I discovered that I was inputting a wrong number into the computer giving me inaccurate results. However, I still managed to find some interesting things after the correction. Ignore what I said about the (0,0,0) solution. That is...

I've been fooling around with the Fibonacci sequence for some time and I thought it would be interesting to see what would happen if I made the coefficients in a three variable system of equations follow that sequence. The results are intriguing and enigmatic. I discovered the following...

Good points. I completely overlooked that fact. You've answered my question exactally. Thanks.

Just a quick question. What areas of mathematics would I have to study to understand Wiles' proof? I know his proof involves the Modularity Theorem, Elliptic Curves etc, but to really understand the proof what other topics would I need to master?

I believe that Fibonacci primes are infinite. Currently there is no proof that there is an infinite number of Fibonacci primes. I was wondering why we couldn't compare the set of Fibonacci primes to the set of Natural Numbers and demonstrate that both have cardinality aleph null? Indeed, why...

Dedekind proposed that an infinite set can be set up with a one-to-one correspondence with a proper subset of itself. I think it would be easy to create a one-to-one correspondence between the natural numbers and every Fibonacci prime because Fibonacci primes are subsets of the natural numbers...

I have read that we do not know if there are an infinite number of Fibonacci primes. So far, no one has produced a proof to show if they are infinite. I wanted to know why this seems to be so challenging? I'm sure it is, and maybe there is a subtle mathematical principle I am missing. I...

No, I completely understand, and honestly I would be skeptical too. Also, I said I believe I've proven it. I know my proof needs to go through peer reviews. I've looked over the proof many times and I can't find any holes, but then again I am not completely objective. My proof is elementary...

I believe I have proven the Strong Goldbach Conjecture. I sent my proof to a professor of mathematics at Lehigh University, professor Jerry King author of several math books. Anyway, he told me that I should submit it to an online journal. He sent me a link, but for some reason it doesn't work...

I believe I have proven a famous open problem in mathematics, and no, it is not the Riemann Zeta hypothesis although that would be nice. Anyway, I want to know how I can submit my proof online and if anyone can give me pointers on preparing my paper. Thanks.