WITH remainders AS (
    SELECT dividends.value AS num, dividends.value % divisors.value AS md 
    FROM generate_series(3, 1000, 2) AS dividends JOIN generate_series(2, 1000, 1) AS divisors 
    ON (divisors.value <= floor(sqrt(dividends.value))+1))
SELECT STRING_AGG(p, '&') WITHIN GROUP (ORDER BY p) FROM (
    SELECT 2 AS p
    UNION ALL
    SELECT num AS p 
    FROM remainders 
    GROUP BY num 
    HAVING MIN(md) <> 0) primes;

WITH RECURSIVE A AS 
    (SELECT 2 AS NUM
     UNION ALL
     SELECT NUM +1 AS NUM
     FROM A
     WHERE NUM < 1000
    ),
    
PRIME AS
    (
    SELECT N1
    FROM
        (SELECT N1.NUM N1, N2.NUM N2,SUM(1) OVER(ORDER BY N1.NUM) S
        FROM A N1
        LEFT JOIN A N2 
        ON (N1.NUM % N2.NUM) = 0
        ) A
    GROUP BY N1
    HAVING COUNT(N1) =1
    )

SELECT GROUP_CONCAT(N1 ORDER BY N1 SEPARATOR '&')
FROM PRIME

WITH enum(n) AS(
    SELECT 1 AS n
    UNION ALL
    SELECT n+1
    FROM enum
    WHERE n<1000
), Numbers AS (
    SELECT
        n
    FROM
        enum
), Divisors AS (
    SELECT TOP 100
        n
    FROM
        Numbers
    ORDER BY
        n
), Is_prime AS (
    SELECT DISTINCT
        n.n,
        COUNT(CASE WHEN (n.n % d.n = 0) THEN 1 END) AS count_divisions
    FROM
        Numbers AS n, Divisors AS d
    GROUP BY
        n.n
), Primes AS (
SELECT 
    n 
FROM 
    Is_prime 
WHERE
    ((count_divisions = 2) AND n < 100) OR ((count_divisions = 1) AND (n > 100))
)
SELECT
    STRING_AGG(CAST(n AS VARCHAR), '&') AS PrimeList
FROM
    Primes
OPTION (MAXRECURSION 1000);