Math help on Congruences, Modulo, Fermat's Theorem, Fermat's Last Theorem (FLT), Euler's Theorem, Euler Totient Function, Divisors, Multiples, Prime Numbers, Prime Number Theorem, Distribution of Prime Numbers, Dzeta Function, Riemann Hypothesis, Algebraic Number Theory, Analytic Number Theory on My Math Forum.
Math problems in Number Theory
by nauticaricky » Wed Mar 10, 2010 11:39 am
Hey all.
I am asked to prove that for integers M,
M is even if and only if M^2 is even.
Any advice? I know I have to start with M and then get M^2, and vice versa, but I don't know where to begin.
Thanks

-
nauticaricky
- Jack of Clubs

-
- Posts: 4
- Joined: Wed Sep 30, 2009 3:12 pm
by pseudonym » Wed Mar 10, 2010 12:19 pm
What does it mean for a number to be even and what does m^2 represent?
It should be easy to see that if m is even then m^2 must be even too. For the other direction suppose that m is not even and prove that in this case m^2 will not be even either. You could start by noting that if m is not even it must be equal to n+1 for some even number n. You can then work out (n+1)^2 and see if this helps you.
-
pseudonym
- King of Diamonds

-
- Posts: 197
- Joined: Wed Nov 26, 2008 3:54 pm
by jason.spade » Wed Mar 10, 2010 1:36 pm
I shall show something of the same vein.
If I multiply an even number and an odd number, I will get an even number.
(2n) = 2mn + 2n, \ which \ is \ an \ even \ number, \ as\ 2 \ divides \ it.)
-
jason.spade
- Ace of Spades

-
- Posts: 387
- Joined: Sun Apr 20, 2008 1:50 am
Return to Number Theory
Who is online
Registered users: Artema2, Baidu [Spider], Google [Bot], MSN [Bot], skipjack, Yahoo [Bot]