![]() |
![]() |
#1 |
"Jason Goatcher"
Mar 2005
DB316 Posts |
![]()
This is my C++ thread, for making comments and getting help when I begin my classes in January. Anybody knowing or doing anything involved in C or C++, especially if you're taking a class on it, feel free to post.
----------------------------------------- In January, I plan to take a beginner's C++ class over at the University of Central Arkansas(UCA), here in Conway. I have no idea how far they go in one Semester, but I'm definitely looking forward to it. I have this dream of taking 3 classes a semester(while keeping my part-time job) for a year or two, and having them all be computer science or math-related. My ultimate(reasonable) goal in this class is to make a program that helps me search for what I call mirror primes. Basically, a mirror number(my made up cocept) is a number that, if flipped over, or flipped to the right or left(like turning a sheet of paper over), results in exactly the same number. For instance 11, 101, 818, and 1881 are all mirror numbers. I hope to make a program that generates these numbers, and then sieves them before running them through Alpertron's app. 2 questions: 1) The Primo website has some very strong language when it comes to running the program(Primo) in certain places. Is this simply to prevent legal liability or am I actually doing something punishable if I run his program(I live in the US). I understand that I won't get tech support from him, but, hopefully, the program would be easy to figure out. 2) Can someone supply me with a simple algebraic formula that could figure out how far to sieve for best efficiency? I assume that there are other things that need to be asked before the formula can be supplied, but I thought I should go ahead and throw it out there. |
![]() |
![]() |
![]() |
#2 |
Aug 2002
7·1,223 Posts |
![]() |
![]() |
![]() |
![]() |
#3 | |
Sep 2002
Database er0rr
24·281 Posts |
![]() Quote:
You might be interested in the page about palindomic primes.. Note the recent find at 170,007 digits by Harvey Dubner. Would you download a copy of M$ Enterprise whatever from a peer-2-peer file sharing system, illegally? Just because there is no money to pay, it does not mean there is no licence agreement between the authors and the enduser -- you can make donations to Primo, but, because you reside in the USA, you *must not use* it, which is made plain at the Primo web site. Sieving, depends on the formula you are using. If you were sieving over 1,2,3,4,...,N then there would be no need to PRP/LLR. Basically, you sieve until it becomes more time-efficeint to do PRP/LLR. That is the average time to next divisor found by the sieve is greater than the average LLR execution time of what is left after sieving. So you need to know the *average* PRP/LLR time of what is left and sieve until finding a divisor takes longer than that average. Divisors are roughly uniformly distributed over your dataset, so you can take the average at any time during sieving e.g. before you start the sieve. Work out your average LLR execution time. This will be dependent on what formula you are using. For fixed k as in k*2^n-1 it is a little tricky to work out the average; For large fix n (in the same form) it is easy -- the average is the time of any single test ![]() (This thread is not about Mersenne Software ![]() Last fiddled with by paulunderwood on 2006-11-01 at 06:01 |
|
![]() |
![]() |
![]() |
#4 |
"Jason Goatcher"
Mar 2005
350710 Posts |
![]()
Sorry about that, I assumed it was a general forum. I guess I should've reviewed the posts already there.
Edit: looks like tetradic is the proper term for my "mirror primes" Last fiddled with by jasong on 2006-11-01 at 11:03 |
![]() |
![]() |
![]() |
#5 | |
Tribal Bullet
Oct 2004
32×5×79 Posts |
![]() Quote:
jasonp |
|
![]() |
![]() |
![]() |
#6 | |
Sep 2004
5×37 Posts |
![]() Quote:
" If the Author is advised that the Software is infringing a patent, the Author shall forbid distribution and use of the Software in all countries where the patent is applicable. " Primo was (is still ?) used by companies to verify RSA prime candidates (and generate RSA keys)...Former versions of the program were sharewares with no ability to generate a certificate for candidates in an "industrial" RSA range...This limitation has been supressed but then I suppose the author has been informed the program was infringing some US softwares patents and he certainly don't want to change his freeware code in a less efficient way (or/and can't bear the idea of software patents ?)... I am sure that if a freeware factorization program becomes popular and widely used for a reason or another, authors will recieve mails showing US patents violations and requesting money for licences... Regards... Philippe. Last fiddled with by Phil MjX on 2006-11-01 at 19:00 |
|
![]() |
![]() |
![]() |
#7 | ||
Tribal Bullet
Oct 2004
32×5×79 Posts |
![]() Quote:
Quote:
jasonp |
||
![]() |
![]() |
![]() |
#8 | |
Sep 2004
5×37 Posts |
![]() Quote:
![]() ![]() ![]() ![]() ![]() ![]() |
|
![]() |
![]() |
![]() |
#9 | |
"Jacob"
Sep 2006
Brussels, Belgium
1,907 Posts |
![]() Quote:
The author of primo objects to those laws as they constitute a danger for any software development. http://swpat.ffii.org/vreji/pikta/index.en.html www.freepatents.org (not online at this moment) ... |
|
![]() |
![]() |
![]() |
#10 |
Aug 2005
Brazil
2·181 Posts |
![]() |
![]() |
![]() |
![]() |
#11 | ||
Tribal Bullet
Oct 2004
32×5×79 Posts |
![]() Quote:
Quote:
jasonp |
||
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Gratuitous factors thread | fivemack | Factoring | 533 | 2023-02-04 08:55 |
Jasong's make something of your life through education thread | jasong | jasong | 20 | 2018-01-05 16:43 |
JasonG's rant thread | jasong | Soap Box | 36 | 2007-09-18 13:43 |
spending thread for JasonG(for a cruncher) | jasong | Hardware | 10 | 2007-04-14 22:14 |
Gratuitous hardware-related banana thread | GP2 | Hardware | 7 | 2003-11-24 06:13 |