Take b = 2.

b^(n-1) mod n = 1.

44959 is prime. b^((n-1)/44959)-1 mod n = 1023, which is a unit, inverse 334007.

(44959) divides n-1.

(44959)^2 > n.

n is prime by Pocklington's theorem.