Wikipedia:Reference desk/Archives/Mathematics/2012 May 18

Mathematics desk
< May 17 << Apr | May | Jun >> May 19 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


May 18

edit

Parity of Numbers Given by Polynomials

edit

The numbers given by f(x) = x are 1,2,3,... and have parity odd, even, odd, etc. The numbers given by f(x) = (1/2)(x*(x+1)) are 1,3,6,10,... (the triangle numbers) and have parity odd, odd, even, even, etc. Via Pascal's Triangle, we can see that there are an infinite number of polynomials where a series of n odd numbers is followed by a series of n even numbers where n is a power of two.

However, I am unable to think of a polynomial such that the numbers generated by it are of the form odd, odd, odd, even, even, even, etc, or in the more general case, where a series of n odd numbers is followed by a series of n even numbers where n is not a power of two.

Can anyone think of such a polynomial? Nkot (talk) 18:14, 18 May 2012 (UTC)[reply]

Cool problem, but I'm pretty sure the answer is that there isn't one. I don't have a good clue for a way to pull in a parity argument though...
Lets define the forward difference operator   for function   as  . If   is a nonzero polynomial, then   is a polynomial of a lower degree, so for any polynomial  , there is   big enough such that   for any x. (  means applying   to   k times). Suppose   is a polynomial which its results have parities odd,odd,odd,even,even,even,odd,odd,odd,even,even,even,... and it easily seen that no matter how many we apply   in it, it will "stuck" at the series even,odd,odd,even,odd,odd,even,odd,odd,... which is not constant, therefore   cannot be polynomial. --77.125.208.4 (talk) 12:56, 20 May 2012 (UTC)[reply]

my matrix-fu is weak

edit

I never learned much matrix algebra beyond what it takes to solve simultaneous linear equations. What can I read to improve my skilz? —Tamfang (talk) 21:01, 18 May 2012 (UTC)[reply]

Any textbook on linear algebra. Looie496 (talk) 00:16, 19 May 2012 (UTC)[reply]
For a course on matrices specifically, I would recommend Gilbert Strang's "Linear algebra and its applications", followed by Horne and Johnson's "Matrix analysis". For a course that emphasizes abstract vector spaces and linear transformations, I would suggest Halmos's "Finite dimensional vector spaces". (A book to follow Halmos is also desirable, but mostly I think I would go with a textbook in abstract algebra, such as Serge Lang's tome at that point.) Sławomir Biały (talk) 20:36, 20 May 2012 (UTC)[reply]
I love specific advice. Thanks, I've saved your remarks. —Tamfang (talk) 08:09, 22 May 2012 (UTC)[reply]

Smallest prime number

edit

What is the smallest prime number that is not divisible by prime numbers smaller than it? 220.239.37.244 (talk) 23:40, 18 May 2012 (UTC)[reply]

"not divisible by numbers smaller than it" is the definition of a prime number; so the answer to your question is the smallest prime number, which is 2. —Tamfang (talk) 00:04, 19 May 2012 (UTC)[reply]
The number you need is 2 my friend, for I have, am and always will be drt2012 (talk) 19:50, 22 May 2012 (UTC)[reply]