JSFiddle - React, Tailwind, and code Playground

JavaScript

// Использована часть библиотеки algoritm-js
const floor = val => (val >= 0 || -1) * Math.floor(Math.abs(val));
const extendedEuclidean = (a, b) => {
  const terminate = 1;

  let x = 1;
  let y = 0;

  let m = 0;
  let n = 1;

  if (a === 0) {
    return { gcd: b, x: y, y: n };
  }

  if (b === 0) {
    return { gcd: a, x, y: m };
  }

  let q;
  let result = {
    gcd: undefined,
    x: undefined,
    y: undefined
  };

  while (terminate) {
    q = floor(a / b);
    a %= b;

    x -= q * y;
    m -= q * n;

    if (a === 0) {
      result = { gcd: b, x: y, y: n };
      break;
    }

    q = floor(b / a);
    b %= a;

    y -= q * x;
    n -= q * m;

    if (b === 0) {
      result = { gcd: a, x, y: m };
      break;
    }
  }

  return result;
};

const findSolution = (a,b) => {
	const ext = extendedEuclidean(a, b);
  if (ext.gcd != 1) {
  	console.log('none');
  } else {
  	x = (ext.x % b + b) % b;
    y = (1 - a*x) / b;
    console.log(`x: ${x}, y: ${y}`);
  }
}

findSolution(7, 11);
findSolution(5, 3);