Assume √41 is rational, so that there exist integers p, q such that
![√(41) = \frac pq](https://img.qammunity.org/2023/formulas/mathematics/high-school/6hhphlr6mj1jvn4qby0aybcn96n9h0drrd.png)
and p/q is irreducible. Taking squares, this would mean
![41 = (p^2)/(q^2) \implies p^2 = 41q^2](https://img.qammunity.org/2023/formulas/mathematics/high-school/26rnehw2qw7elxmnau4cxfjhgjtp3rzmhg.png)
This tells us that 41 is a factor of p², which in turn means 41 is a factor of p because 41 is prime. We can consequently write p = 41n for some integer n. But then
![p^2 = (41n)^2=41q^2 \implies 41n^2 = q^2](https://img.qammunity.org/2023/formulas/mathematics/high-school/7c7rblom9ddqlnfm5ey5jk98rfq5ozhh00.png)
which says 41 also divides q² and hence divides q as well. In other words, p/q is reducible, so we have a contradiction.