Solution to r/DailyProgrammer challenge #277 (https://www.reddit.com/r/dailyprogrammer/comments/4uhqdb/20160725_challenge_277_easy_simplifying_fractions/)

simplify-fraction.js

const gcd = (x, y) => y ? gcd(y, x % y) : x;

const simplify = xs => xs.map(x => x / gcd(...xs));

export default str => simplify(str.split(' ')).join(' ');

simplify-fraction.test.js

import m from '.';

test('4 8 -> 1 2', () => {
	expect(m('4 8')).toBe('1 2');
});

test('1536 78360 -> 64 3265', () => {
	expect(m('1536 78360')).toBe('64 3265');
});

test('51478 5536 -> 25739 2768', () => {
	expect(m('51478 5536')).toBe('25739 2768');
});

test('46410 119340 -> 7 18', () => {
	expect(m('46410 119340')).toBe('7 18');
});

test('7673 4729 -> 7673 4729', () => {
	expect(m('7673 4729')).toBe('7673 4729');
});

test('4096 1024 -> 4 1', () => {
	expect(m('4096 1024')).toBe('4 1');
});