List Commands Library for 50g

02072018, 09:10 PM
Post: #250




RE: List Commands Library for 50g
Truncation sounds fine to me, especially since I\>R requires (real) integers and will error out if given a number with a fractional part.
Capping at 999999999999 would probably be OK. It would be ideal if LMSEQ could return large integers but that would run into the aforementioned speedandcomplexity problem. Actually, I have always thought of I\>R and R\>I as being reasonably fast. There are, however, several commands that are very slow for exact integers. Comparison operators ( <, >, ==, etc.), and MOD are much slower for exact integers than for reals. IDIV2, IQUOT, and IREMAINDER, which are CAS functions are even slower. The Prime versions of those 3 functions are also slow, and I expect that is because they are complicated programs that also work on symbolics, rationals, etc. If someone could come up with faster, simpler versions of those commands, it would give a HUGE speed boost to many number theory programs. Sorry to go offtopic but I have been frustrated lately by slow integer commands and I was reminded of the problem by the discussion of reals vs. integers. John 

« Next Oldest  Next Newest »

User(s) browsing this thread: 2 Guest(s)