An observation I made (checked for the range 3-10000)suggests that ODD composite nos can be described as follows: - composite(odd)< 121 : divisible by 3,5 or 7...
... Are you being serious? What do you mean? What about 225? Have you thought about this at all? So once you get past 121, there are no numbers divisible by 7...
Sorry folks, obvious error in my previous message. Not quite with it today. Take 2: An observation I made suggests that ODD composite nos can be described in...
... Umm well ok. Same response. What about 539? Or 275? Or 325? Or 455? Or 357? And so on, and so on.... Odd numbers are: - Divisible by one of 3,5 or 7, or -...
Oh dear. Its finally dawned on me I'm just stating the obvious by definition. Sorry. I'm going to try to stop thinking about prime nos for some time (I can...
That's OK Navid, many of us have been there! We get so focused and narrowed in on something that we loose sight of the obvious. Now that I'm typing, I must say...
HI, I am starting a new distributed computing project which is available at http://groups.yahoo.com/groups/primenumbers/files/2*a^a+-1 prime search/index.htm ...
Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the primenumbers group. File : /2*a^a+-1...
primenumbers@yahoogro...
Sep 1, 2003 9:05 pm
13439
... available ... The look of your pages look familiar; lol. I got my colours from mersenneforum.org I use a yahoo database to store my table; then export it;...
You have X*Y possible cases, where X is the range for the x and Y the range for the y. Let's call T to the favorable cases (number of primes discovered within...
I have a thumb rule that has never failed to date. It is to simple but is good to avoid many mistaken basic research. "No formula or algorithm expressed with a...
Hi, I am new to the prime numbers. Does anyone know what is the best deterministic algorithm that says if a number is prime. If one can guide to me with a link...
... Here's a good link: http://www.utm.edu/research/primes/prove/index.html ... http://www.mersenne.org/ ... Yes - Proth primes. The test for Proth primes is...
... best ... guide ... please ... For a general purpose proving algorithm see: http://www.ellipsa.net/ this program will take several months to prove a number...
--On Tuesday, September 02, 2003 1:05 AM +0000 Paul Underwood ... However, it is much faster on numbers even a little smaller - think days for a 3000 digit...
... The "how long does it take" heading on that page says:- ... Remember: this is not true for the larger values of "a", as each test takes time proportional...
Firstly,another thing I've realized,I never introduced myself to the group. For what its worth,I work in the Medical Physics Dept.@Guy's Hospital,London. My...
If there is a web page somewhere dealing with exactly this then I would appreciate it if someone would point me in its direction... Let k be a positive odd...
In what follows, I use the term "consecutive triad sums". Here's what I mean: Take any "X" distinct integers "N" and arrange them in ascending numerical order...
w_sindelar@...
Sep 2, 2003 12:55 pm
13450
... But you must be more specific. How close is 'very close'? To make this statement even vaguely acceptable, you'd have to look at a hell of a lot more primes...
Please excuse this slow response, I have been out of town for my parents' 50th wedding anniversary. I hate to add to the success of Jon's latest troll but I...
Dr. Caldwell and myself are beginning to rearrange the files area. I at least plan to think over a few things and do more tomorrow. Feel free to post or email...
A few months ago, I started to search for twin primes that would be both generalized Cullen and generalized Woodall numbers. This means n*a^n+1 and n*a^n-1. ...
... As part of my investigation of the factor structure of these numbers, I have run PFGW with "-d -f200" on all values of a <= 5000, for both forms, which ...
How many primes N=2*a^a+-1 can we expect for X_0 <= a <= X? If N was a "typical" integer of that size, the probability of its being prime would be 1/log(N), by...
I have been working in complex dynamics for years and have done recent work in minimal surfaces and constant mean curvature surfaces. It never occurred to me...
I expect a prime for the + series under 35000 and for the - series under 30000 Harsh Aggarwal ... being prime ... of these ... only an ... +log(2)) ... ...
