This question asks which statement is NOT guaranteed once E is fixed in the middle seat of a row of five, with two numbers sitting on each side of it. Since E's factors are P and R, only A, B and D can ever sit right beside it, because C's factors Q and S share nothing with P or R, so C cannot touch E at all. That pushes C to one of the two end seats of the row. Working through the remaining seats carefully, the only rows that fit every clue turn out to be C, B, E, A, D and C, B, E, D, A, along with their mirror images D, A, E, B, C and A, D, E, B, C, which is C's other end flipped around. Four rows in total, and every option must be checked against all four before it can be called "always true".
Since (A), (B) and (C) hold in every one of the four valid arrangements listed above, but (D) fails in at least one of those same valid arrangements, (D) is the statement that need not be true, making it the required exception to the rule.
Let's summarize:
The exception, the statement that need not always be true, is option (D), A is arranged at one end in the array.
Statement: All flowers are beautiful. Some beautiful things are fragile.
Conclusion I: Some flowers are fragile.
Conclusion II: All beautiful things are flowers.