Let \(Q\) be a set of permutations of \(1,2,...,100\) such that for all \(1\leq a,b \leq 100\), \(a\) can be found to the left of \(b\) and adjacent to \(b\) in at most one permutation in \(Q\). Find the largest possible number of elements in \(Q\).
1. **Understanding the Problem:**
   We need to find the largest possible number of permutations of the set \(\{1, 2, \ldots, 100\}\) such that for any pair of numbers \(a\) and \(b\) (where \(1 \leq a, b \leq 100\)), \(a\) can be found to the left of \(b\) and adjacent to \(b\) in at most one permutation in the set \(Q\).

2. **General Case Analysis:**
   Consider the general case for a set of \(2n\) elements, i.e., \(\{1, 2, \ldots, 2n\}\).

3. **Applying the Pigeonhole Principle:**
   If \(|Q| > 2n\), then there are more than \(\frac{(2n)!}{(2n-2)!}\) possible ways of selecting ordered number pairs \((a, b)\). According to the Pigeonhole Principle, at least one pair \((a_0, b_0)\) would be repeated, which contradicts the given condition.

4. **Constructing the Permutations:**
   When \(|Q| = 2n\), we can construct the permutations as follows:
   - For each \(k\) where \(1 \leq k \leq 2n\), the permutation is:
     \[
     \{k, k+1, k-1, k+2, k-2, \ldots, k+n-1, k-(n-1), k+n\} \mod 2n
     \]
   - Notice that the absolute value of the difference between neighboring terms is \(1, 2, 3, \ldots, n-1, n, n-1, \ldots, 2, 1\).

5. **Verification:**
   - For \(2n = 100\), we can apply the same construction.
   - This ensures that each pair \((a, b)\) appears adjacent in at most one permutation.

6. **Conclusion:**
   - Therefore, the largest possible number of elements in \(Q\) is \(100\).

The final answer is \(\boxed{100}\)