User talk:Prime007

Dmcq (talk) 13:04, 13 April 2011 (UTC)

April 2011
Welcome to Wikipedia. Although everyone is welcome to contribute to Wikipedia, at least one of your recent edits, such as the one you made to Wikipedia:Reference desk/Mathematics, did not appear to be constructive and has been reverted or removed. Please use the sandbox for any test edits you would like to make, and read the welcome page to learn more about contributing constructively to this encyclopedia. The reverted edit can be found here. Thank you. HJ Mitchell &#124;  Penny for your thoughts?   17:29, 11 April 2011 (UTC)

Please refrain from making unconstructive edits to Wikipedia, as you did at Wikipedia:Reference desk/Mathematics. Your edits appear to constitute vandalism and have been reverted or removed. If you would like to experiment, please use the sandbox. Thank you. Please do not remove other editors' questions or comments from the reference desk. Kinu t /c  16:40, 12 April 2011 (UTC)

Please refrain from making unconstructive edits to Wikipedia, as you did at Wikipedia:Reference desk/Mathematics. Your edits appear to constitute vandalism and have been reverted or removed. If you would like to experiment, please use the sandbox. Thank you. Dmcq (talk) 17:20, 12 April 2011 (UTC)

Maths reference desk
I have put a welcome above in case you are misunderstanding what is being said to you. Please do not delete other people's contribution and do not pout your email or address onto a page please. You should add what you want underneath other peoples contributions to a section. Dmcq (talk) 13:04, 13 April 2011 (UTC)

Prime Numbers
Am I right to assume that you were considering the sequence of numbers given by (p&thinsp;–&thinsp;2)·n&thinsp;+&thinsp;2, where p is a prime number and n is an even number? Why do you need n to be even? It causes you a lot of problems because, if n is even then we can write n = 2m for some whole number m. In this case, we have (p&thinsp;–&thinsp;2)·n&thinsp;+&thinsp;2 = (p&thinsp;–&thinsp;2)·(2m)&thinsp;+&thinsp;2 = 2·((p&thinsp;–&thinsp;2)·m&thinsp;+&thinsp;1). Clearly two divides 2·((p&thinsp;–&thinsp;2)·m&thinsp;+&thinsp;1) which means, unless it is actually equal to two, that it can't possibly be prime. It would be better to consider the sequence (p&thinsp;–&thinsp;2)·n&thinsp;+&thinsp;2, where p is prime and n is odd. That way, you might have a chance. Maybe do some examples when n is odd, and see if any patterns emerge. Also, modulo arithmetic is useful for proving certain facts. Try reading that article if you have time. — Fly by Night  ( talk )  17:47, 13 April 2011 (UTC)