Recent content by ull

Please don't post any more clues just jet I am trying to figure it out it :):) I don't know if this translates very well, but: "I´m going to sleep on it " ;)

Statements: x is an integer x is a prime number if x doesn't consist of any prime factors ≤√x Proof: Since (√x + 1) * (√x + 1) > √x * √x x must be a prime Questions: Whould you consider this a non-rigorous direct proof? If not, what does it lack? Is this a good approach trying to...

If the square root of the last number isn't an prime number (quadrat/"perfect square") then the last number must be a prime?

Is the faster ways of finding prime factors less reliable? If so, in what sense?

Is this line of thought correct? Please correct me where I´m wrong. Will this way of finding prime factors work when A is any integer? Is there a proof for this or a proof that is closely related? Is there a way to do it that requiers less iterations? It has to be a method that requires...

PS. I don't speak or write english very well. I´m doing my best. Is it still ok to post questions? a = any integer b = any prime number a * b = c Is there a proof that "c" isn't made up by any other prime factors than the prime factors that make up "a" (except for "b")?