I apologize in advance as this is probably a really foolish question, however I am quite tired and also new to the idea of provably fair and would love some help understanding.

This is in regard to dice sites who generate a server seed every 24 hours.

With provably fair, is there a way you could solve for the unhashed server seed algebraically?
If you were to roll the dice, once you have the outcome of the roll you would have every variable besides the unhash (x)


So for demonstration purposes lets say  Client Seed+Server Seed Hash+Server Seed Unhash = Dice Roll.
If client seed = 1, server seed hash = 2, and your previous dice roll = 50
Could 1+2+x=50 be solved for X which would be the unhashed seed?