Challenge #275: Greatest Common Denominator

[ahsanaali]

Spoiler

[peter_gb]

I brute forced this one, would like to come back and use the iterative approach to properly construct the Euclid's algorithm method as outlined here https://www.cuemath.com/numbers/greatest-common-divisor-gcd/  but will have to revisit when I have more time :)

Spoiler

 

[DataNath]

My solution to #275.

Spoiler

[NikkiJain]

Spoiler

Spoiler 

I have used Python to solve this.

This is the Python code, I am using:

from ayx import Alteryx

import pandas as pd
import math
data = Alteryx.read("#1")
df = pd.DataFrame(data, columns=['Material', 'Volume'])

def findgcd(x, y):
while(y):
x, y = y, x % y
return x

l = df.Volume.values
num1=l[0]
num2=l[1]
gcd=findgcd(num1,num2)

for i in range(2,len(l)):
gcd=findgcd(gcd,l[i])

result = gcd

output = pd.DataFrame([gcd], columns = ['Material A'])

Alteryx.write(output,1)

[FrederikE]

Spoiler

[ZacharyRyanTIL]

solved

[gerda]

Spoiler

Here's the solution!

[RWvanLeeuwen]

I wonder if my solution is sufficiently robust, but I think it would

Spoiler

for each material: get the distinct volumes and compare it with the highest; use that fraction and get the lowest value so we only look at the increment size and use that as the GCD

the silliest thing happened though because the summarize tool produces a value that is not the minimum in the set...

[SkomantasTamulaitis]

Here's my solution.

Spoiler

[ARussell34]

Needed a refresher and to make sure to group by the materials, but found 840 and 9,360 were the greatest common denominators.