Let n be an integer greater than 0. Show that there is a prime p such that p | n (p divides n). Don't use the theorem that every integer greater than 1 can be expressed as a product of prime numbers.
I really don't know how to go about solving this one without using the theorem I can't use
Let p be prime, p >= 5. Show that p is of the form 6k+1 or 6k+5 for some integer k.
I was trying to use induction here but get stuck trying to prove for n+1 (I was inducting over k)
Thanks for any help