![]() |
![]() |
#1 |
Feb 2018
9510 Posts |
![]()
¿ 200x faster that PARIGP ?
I believe PARIGP is unbeatable. |
![]() |
![]() |
![]() |
#2 |
Feb 2018
5×19 Posts |
![]()
Nothing about troll.Well.
I believe PARIGP is also writen on C/assembler. And is made with state of art algorithms. I dont understand. |
![]() |
![]() |
![]() |
#3 |
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
37·163 Posts |
![]() |
![]() |
![]() |
![]() |
#4 | |
"Dana Jacobsen"
Feb 2011
Bangkok, TH
32×101 Posts |
![]() Quote:
Parts of PARI are close to state of the art, parts are quite old. Most of the parts I'm familiar with are very good but not state of the art. Factoring, primality testing, prime generation / looping, moebius/totient/etc., partition counting, ... all nice but significantly behind the state of the art. A lot of the functions could be optimized further for small (e.g. 32-bit or 64-bit) integer inputs, but at the expense of more convoluted code. There is a lot to be said for packaging so much useful stuff that works, is decently fast, available on many platforms, isn't really fiddly like some state of the art stuff can be, and is open source. |
|
![]() |
![]() |
![]() |
#5 |
Feb 2018
9510 Posts |
![]()
And then Whats the best tool for Number Theory?
|
![]() |
![]() |
![]() |
#6 |
Sep 2002
Database er0rr
5×29×31 Posts |
![]()
"Best" used here is subjective. It is very easy to concisely express ideas with PARI/GP's vast number of functions. Dana's number theory Perl module(s) may well be quicker for some calculations. Sometimes it is best to mix and match, for instance I have used GMP plus primesieve libraries with C/C++.
![]() ![]() Last fiddled with by paulunderwood on 2018-03-06 at 09:37 |
![]() |
![]() |
![]() |
#7 |
Feb 2018
5×19 Posts |
![]()
About "best in life?". For me is "Never stop trying."
I supose for you must be "Never stop trying... divisors." :-) |
![]() |
![]() |
![]() |
#8 |
Aug 2006
5,987 Posts |
![]()
I split out these posts so as to keep danaj's thread on-topic.
The new thread name is a reference to https://www.youtube.com/watch?v=6PQ6335puOc |
![]() |
![]() |
![]() |
#9 |
"Forget I exist"
Jul 2009
Dartmouth NS
100000111000102 Posts |
![]()
Best would depend on algorithm and language version probably. You can write algorithms that get to the same result possibly tens, if not hundreds or thousands of ways ( some of these may have previous versions steps within them).
Last fiddled with by science_man_88 on 2018-03-06 at 19:40 |
![]() |
![]() |
![]() |
#10 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
240518 Posts |
![]() |
![]() |
![]() |
![]() |
#11 | |
Jun 2003
10101001111102 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
what is the purpose of my life ? | science_man_88 | science_man_88 | 89 | 2018-05-23 20:39 |
life in a moment | cmd | cmd | 1 | 2018-02-06 16:29 |
end-of-file is the end-of-me-life | davar55 | Programming | 15 | 2013-02-21 19:00 |
Universal Life Policies | Zeta-Flux | Soap Box | 16 | 2012-05-27 04:09 |
Life after Death! | mfgoode | Soap Box | 92 | 2010-12-19 19:04 |