JaKiri Posted July 18, 2004 Share Posted July 18, 2004 g is every prime integer starting with 2, 3, 5, 7, 11, and 13. You plug in 2-100 for each prime, and the numbers not found are prime. You add those numbers to the list and do the same for the next 100 numbers. I cannot do it too fast soo, I need a computer to do it. But anways... As I said before, you have no concept of mathematical proof. You can't prove it by doing it for 100 numbers. For 1000. For 10^10^10^10^10. Because no matter how many numbers you test it with, there are still INFINITE numbers that can still apply. What if it breaks with 10^10^10^10^10 + 1? You need to prove it irrevocably for all numbers, or admit that you can't prove it and you're just being a foolish person, or this thread will be closed pretty quickly. Link to comment Share on other sites More sharing options...
Dave Posted July 18, 2004 Share Posted July 18, 2004 g is every prime integer starting with 2, 3, 5, 7, 11, and 13. You plug in 2-100 for each prime, and the numbers not found are prime. You add those numbers to the list and do the same for the next 100 numbers. I cannot do it too fast soo, I need a computer to do it. But anways... Sounds like a pretty inefficient method of prime-finding to me; that certainly won't win you any awards. Link to comment Share on other sites More sharing options...
NSX Posted July 18, 2004 Share Posted July 18, 2004 I don't understand what Freeman is saying... Unless it's like Goldbach's Conjecture. Link to comment Share on other sites More sharing options...
Dave Posted July 18, 2004 Share Posted July 18, 2004 I have to say that I don't fully grasp it myself atm. Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now