The greatest common divisor and least common multiple functions from the
GMP library. These return a bigint if at least one of the arguments is a
bigint, a machine int otherwise.
indeed:
> show lcd show: unknown symbol 'lcd' > show lcm lcm x::bigint y::bigint = __C::bigint_lcm x y; lcm x::int y::bigint = __C::bigint_lcm (bigint x) y; lcm x::bigint y::int = __C::bigint_lcm x (bigint y); lcm x::int y::int = int (__C::bigint_lcm (bigint x) (bigint y)); >
Albert Graef
unread,
Aug 21, 2019, 12:37:34 PM8/21/19
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to pure...@googlegroups.com
On Sat, Jan 12, 2019 at 10:50 PM Kurt Pagani <nil...@gmail.com> wrote:
Least common multiple should read lcm (nit-picking ;-)
Indeed. ;-) Fixed in git. Thanks for spotting this. And sorry for the long delay, somehow your post got buried deep in my inbox. :(