It's difficult! But can you solve it?

If \(p, q\) and \(r\) are all prime numbers greater than 3, what is the largest number which always divides \(p^2q^2r^2 - p^2q^2 - q^2r^2 - p^2r^2 + p^2 + q^2 + r^2 - 1\)?

×

Problem Loading...

Note Loading...

Set Loading...