Hello All: Can anyone prove this conjecture? For all n>2 ; for all i: 1<= i<= n exist j: n+1 <= j <= n^(3/2) (1+pj)/(-1+pi) is integer. pi is the ith...
Hello all, I wish to share with you a couple of formulas that I have been "working" with for some time. Let J(n) = the number of ways of writing n as the sum...
... Yes, yes. Maybe I'll share that proof later, hehe. Along similar lines: Given a prime p, is there always an r < (log(2*p+1))^2 such that p*r - 1 is prime? ...
Sebastian asked the following. 1a. Prime Conjecture Posted by: "Sebastian Martin" sebi_sebi@... sebi_sebi Date: Sun Mar 2, 2008 8:25 am ((PST)) Hello...
I blundered into a new approach to factoring. Given the positive integer z to be factored, find a matrix [A -B] [C D] which has determinant equal to Z. ...
Toward a Polynomial Time Factoring Algorithm. Goal: To factor positive integer z. Select positive integer t, slightly larger than sqrt(z). t**2 - z = d s**2 ...
I have a set of 16 linear equations in 16 variables , for which the coefficients are expressions in parametric variables, which may be considered constant,...
... No. Any 6-tuple of length 14 will have at least one number which is divisible by 2, 3 or 5. See http://anthony.d.forbes.googlepages.com/ktpatt.txt and...
Hello all! Can anyone give me a reference(if possible on the web) of the following theorem: Let p be prime, d=2*p*j+1, d=1(mod 8) and j even, then x^{2j}=2...
The Prouhet Tarry Escott problem. Jagan Eedula 13- March- 2008 Abstract: In this paper we develop a method for determining Tarry Escott Numbers and Ideal...
I Have a mathematician friend and I am trying to convince him of the following: Take P(m) to be the set of primes less than the square root of an integer n. ...
i need to talk to a ubasic 'expert'. or anyone helpful. desperate, jen ... Looking for last minute shopping deals? Find them fast with Yahoo! Search. ...
In general, there is this relationship between the factors of a number N, and the factors of (N-1) If m2 is a divisor of (N-1), and we can find m1 and m3...
On Tuesday, March 18, 2008 8:09 AM, gulland68 wrote in primenumbers: TG>> Consider a matrix in which members of P(m) index rows and in which each column that...
Hello , I have found a relation for Mersenne primes. Perhaps is it know ?! R=(2*M(p)-2)/3=(T^2 mod M(p)) The problem is,how can I proof that exist a number T ...
T is not >=R. We find for M(5) T=12,19 M(7) T=46,81 M(11) no T so that T^2 mod 2047 = 1364 M(13) T=2262,5929 .... N.L. Lesen Sie Ihre E-Mails jetzt einfach von...
I just started to read David Bressoud's and Stan Wagon's excellent book, "Computational Number Theory". In the first chapter, section 1, they discuss...
... Now grab a copy of Knuth, and work out the Big-Oh of that. ... There's an explanation of efficient implementation in Crandall & Pomerance. One method...
... if R=(2*Mp-2)/3=((T^2) mod Mp), then... ... (it's a plausible idea), but if it works?? it's better than LL I can determine the exact T(sub k) to use in...
Thanks to Phil's hint, I have improved my FibonacciMod routine. My previous routine, using recursion, was inefficient. I see now that the recursion routine...
Sorry if this is a daft question...there is a lot of searching going on for primes in AP, but are there primes that are not in AP, if AP>2? Got a feeling the...
... An AP of primes starting at p cannot have length above p, because p would divide term p+1 which is p + a*p where a is the common difference in the AP. It...
Has anyone found a connection between prime numbers and Viswanath's constant? I believe I may have found a similar property, that the Fibonacci and Lucas...
I implemented an idea that I thought might speed up the trial division method of finding the factors of an integer. These are the times I recorded for 5...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
