If each digit in the set of A = {1,2,3,4,5,6} is exactly…

If each digit in the set of A = {1,2,3,4,5,6} is exactly used once, in how many ways can the digits be arranged such that the 2 and 5 are not adjacent?

This problem repeats another one in the library (at most with different numbers), so it's left out of browsing.

AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #72597