True; recall that I used the phrase " Hope to prove"; Also the improbabality indicated by me is so great that I can safely challenge anyone to produce a...
... Congratulations on continuing your AP record sweep, now AP4 to AP10. http://users.cybercity.dk/~dsl522332/math/aprecords.htm is updated. -- Jens Kruse...
Hi Jens, Thanks for the congrats I think I'll move on to something else for a while. My method is not well suited for searches above ap10 Poisson was kind to...
On the other hand all the factors of a Carmichael Number can be Mangammal primes (see A123239-OEIS); example 29341. It is inteesting to note that Maxal had...
In my presentation of “Minimum Universal exponent generalisation of Fermat's theorem” at the Hawaii Intl conference in 2006 I had stated that 31 is a ...
Thank you very much; my knowledge of programming is limited to some elementary programming in pari. My approach is purely mathematical. By this I can find...
Hi All, ... I third that "wow". I have updated http://www.primes.viner-steward.org/andy/titans.html and http://www.primes.viner-steward.org/andy/annual.html ...
The corners of the Ulam Spiral are 4n^2-2n+1 (NE) 4n^2+1 (NW) 4n^2+2n+1 (SW) and 4n^2-4n+2 (SE) [this is always divisible by 2] The first one produces good...
miltbrown@...
Jun 3, 2009 6:21 pm
20361
For those interested, exhaustive searching has verified the 2nd HL conjecture for all widths up to 2529 integers. The bounds for the first contradiction are...
In fact if n is the exponent in 2^n + 29, any value of n ending in 1 or 6 is divisible by 31. This has something to do with group theory. Devaraj ... ...
A QUESTION ABOUT PROGRAMMING This pertains to my post: “An indirect primality test of......” For the sake of this example let x = 1000 i.e. The prime...
... The idea is to avoid large numbers. If you write Mod( big^something ...) you did not avoid anything. If you write Mod( big, m )^something then you create...
I've been using Google Talk and thought you might like to try it out. We can use it to call each other for free over the internet. Here's an invitation to...
I have extended the Ulam Spiral by starting with a prime number (at the center). Then a large number of primes are on the NW corner values. For 101 at the...
miltbrown@...
Jun 5, 2009 3:35 pm
20368
... [snip] I retract yesterday's post. Further reflection and numerical experiments have shown that using "(k+3)" is no better than using "(k+4)", and it is...
VERIFICATION II The following are lists of some of the a) factors and b) non-factors of 2^(2^521-1) + 61 a) 3 and 7 b)5, 13, 23, 11, 11,31, 317, 191, 19, 37,...
Hi Mike, Having now "carefully" read your posting and while still thinking that the end result gives a good indication of difficulty I have questions about the...
This is a follow-up, but taking y=x+2. Redefine: x=a-1 y=a+1 where "a" is the mean of "x" and "y". Redefine the matrices: X=[a-1,-1;1,0] Y=[a+1,-1;1,0] and ...
... If by "the number" you mean 2^(3^53)+99, then clearly it isn't too big for any computer as it can trivially be represented using only 9 characters. It's...