mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2020-11-27, 11:47   #12
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

1,979 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
What sorts of primes do you prove by trial factoring?

In what context do you mean "ECPP is factoring regardless"?



I assume you prove them prime by ruling out the existence of prime factors less than or equal to square root of N.
But please correct me if I am wrong.
I assume elliptic curve testing does the same thing but that's perhaps because I have no clue what it does.

Last fiddled with by a1call on 2020-11-27 at 11:48
a1call is offline   Reply With Quote
Old 2020-11-27, 15:52   #13
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

3·5·307 Posts
Default

Quote:
Originally Posted by a1call View Post
I assume you prove them prime by ruling out the existence of prime factors less than or equal to square root of N.
I didn't ask for the procedure, I asked which primes you would use that slowest-possible procedure on, instead of something faster.

No, ECPP isn't a factoring algorithm. You could try wiki for a basic explanation, which may still be over your head but at least it'll show you it's not trial factoring.
VBCurtis is online now   Reply With Quote
Old 2020-11-27, 22:45   #14
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

1,979 Posts
Default

Quote:
Originally Posted by Batalov View Post
10474500 + 999 · 10237249 + 1 (a palindrome) has 50% factorization and is 474,501 decimal digits long.

Also,
1234471048576-123447524288+1 is prime! (5,338,805 decimal digits) Time : 187808.030 sec.
Links to Batalov's relevant primes: Kudos.

https://primes.utm.edu/primes/page.php?id=123041

https://primes.utm.edu/primes/page.php?id=118775

I see N-1 in both notes.
a1call is offline   Reply With Quote
Old 2020-11-27, 22:52   #15
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

1,979 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
I didn't ask for the procedure, I asked which primes you would use that slowest-possible procedure on, instead of something faster.

No, ECPP isn't a factoring algorithm. You could try wiki for a basic explanation, which may still be over your head but at least it'll show you it's not trial factoring.
Well here is the link to wiki and yes it is written in a Klingon dialect with which I am not familiar.

I will spend some time to see if I can decipher the numeric example but don't hold your breath.

https://en.wikipedia.org/wiki/Elliptic_curve_primality

Last fiddled with by a1call on 2020-11-27 at 22:52
a1call is offline   Reply With Quote
Old 2020-11-27, 23:06   #16
Nick
 
Nick's Avatar
 
Dec 2012
The Netherlands

2·7·113 Posts
Default

There is a good introduction to the mathematics of elliptic curves (aimed at people who did not study mathematics itself at university):
https://press.princeton.edu/books/ha...elliptic-tales
Nick is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! dabaichi News 571 2020-10-26 11:02
Not the largest prime Tomws Lounge 5 2020-05-03 01:46
Largest known prime Unregistered Information & Answers 24 2008-12-13 08:13
Largest 64 bit prime? amcfarlane Math 6 2004-12-26 23:15
need Pentium 4s for 5th largest prime search (largest proth) wfgarnett3 Lounge 7 2002-11-25 06:34

All times are UTC. The time now is 01:00.

Sun Jan 17 01:00:15 UTC 2021 up 44 days, 21:11, 0 users, load averages: 1.40, 1.56, 1.61

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.