sorry for the 2nd one its for n is greater than or equal to 3.
n is prime for all positive integers r and s if n=rs where r=1 or s=1
**fixed the original post
Homework Statement
Suppose that we play the following game. You are given a pile of N matches. You break the pile into two smaller piles of m and n matches. Then you form the product 2mn and remember it. Next, you take one of the piles and break it into two smaller piles (if possible), say of...
If m and n are positive integers, (mn)!=m!n! Prove or disprove.
its so obviously true i can't prove it. anyone help?
-also-
Prove: The square root of a prime integer is an irrational number.
any help?