Challenge #275: Greatest Common Denominator

[KilianL]

No need for prime factorization - Alteryx runs over all potential divisors in 0.3 seconds!

スポイラ

[Sashikumar]

Learned from Solution.

スポイラ

[ryan-bush]

Not the most dynamic solution but fun challenge regardless!

[kelly_gilbert]

For fun, using the Generate Rows tool to iterate and apply the Euclidean algorithm (instead of using a macro).

スポイラ

[lemuelcastro]

My solve!

With macro iterative and batch to Euclidean Algorithm!

[lemuelcastro]

After Learning with @kelly_gilbert !

スポイラ

[Michael_McKee]

A little bit Brute Force.  Could have rolled it up into a single Formula.

[CRowlatt]

I went for the brute force attack too! Still runs in less than a second.

[jagdeep_singh85]

HI 

PFA my solution

[AndrewDearstyne]

I can't get any simpler than this.

スポイラ