I am new to Maple. I need to measure the time complexity of computing the GCD for a set of 1024-bit numbers. I have an equation as:
O(nm × log^2 m × log log m). Where n is the number of bits in the numbers in my set (say, 1024-bit) and m is the number of times I am going to do a computation. How can I perform this computation in Maple ?