I'm writting a large exam using exam class. I want to create many versions (at least two) of the exam by permuting the questions. I think I had seen something like that in the user manual, but now I can't find it.
Originally I want to do that with a problem sheet with 100 questions. But an example could be the following:
\documentclass{exam}
\usepackage[utf8]{inputenc}
\usepackage[spanish,shorthands=off]{babel}
\usepackage{cmbright}
\usepackage[T1]{fontenc}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{tikz}
\usetikzlibrary{calc, cd}
\newcommand{\n}[1]{\boldsymbol{#1}}
\theoremstyle{definition}
\newtheorem{ej}{Ejercicio}
\newcommand{\tq}{\;|\;}
\title{Conjuntos Abstractos}
\author{}
\date{}
\begin{document}
\maketitle
\begin{questions}
\question Demuestra que iso implica biyectiva.
\question Demuestra que la categoría $1/\mathcal{S}$ tiene todos los límites finitos. Los objetos de $1/\mathcal{S}$ son parejas $(A,a:1\to A)$, donde $A$ es un conjunto abstracto; y las flechas $f:(A,a:1\to A)\to(B,b:1\to B)$ son flechas entre conjuntos abstractos $f:A\to B$ que hacen conmutar al siguiente diagrama
\begin{center}
\begin{tikzcd}
& 1 \arrow[ld, "a"swap] \arrow[rd, "b"] \\
A \arrow[rr, "f"swap] && B
\end{tikzcd}
\end{center}
\question Demuestra que si una categoría $\n{C}$ tiene coproductos y coigualadores entonces tiene todos los colímites.
\question Demuestra que todo igualador es mono.
\question Sean \tikzcd[cramped, sep=small] U \arrow[r, rightarrowtail, "i"] & A \endtikzcd{} e \tikzcd[cramped, sep=small] V \arrow[r, rightarrowtail, "j"] & A \endtikzcd{} subobjetos de $A$. Diremos que $i$ es equivalente ($i\sim j$) a $j$ si $i\subseteq j$ y $j\subseteq i$. Demuestra que la relación $\sim$ es de equivalencia.
\question Sean $A$ un conjuntos abstractos y considera los conjuntos
\begin{gather*}
Sub(A)=\{\tikzcd[cramped, sep=small, ampersand replacement=\&] U \arrow[r, rightarrowtail, "i"] \& A \endtikzcd{}
\tq \text{$i$ es mono}\}/\sim \\
\mathcal{S}(A,B)=\{f:A\to B\tq\text{$f$ es una flecha en $\mathcal{S}$}\}
\end{gather*}
Demuestra que hay una biyección $Sub(A)\cong\mathcal{S}(A,2)$.
\end{questions}
\end{document}
For the structure and the kind of text, it can be compiled using PDFLaTeX, PDFTeX, XeTeX,... If there is a good solution using a specific compilation method I can use it with no much trouble.
Does anyone knows how to do something like that?
Thanks in advance
exam
class). Perhaps I can hack me into something and provide what you need. Important question: Are you using XeTeX (or XeLaTeX) or another engine?