public static long trouverE(long s, long phiN) {
        if (s <= 1 || phiN <= 1) throw new IllegalArgumentException();

        while (Num2.euclideEtendu(phiN, s)[0] != 1) {
            s++;
        }
        return s;
    }