Hello everyone,
So there is only one month left between my glorious summer and the beginning of my fall semester, also the beginning of my intensive mathematics major. This fall I'm planning on taking a total of FIVE advanced math courses in the undergraduate school where I'm at. Besides from...
Def: A polynomial f(x) with coefficients in Q (the rationals) is called a "numerical polynomial" if for all integers n, f(n) is an integer also.
I have to use induction to prove that for k > 0
that the function f(x) := (1/k!)*x*(x-1)...(x-k+1) is a numerical polynomial
I checked that...
Thanks a lot. Maybe I'm just stupid, but why is "a" a multiple of 12? (a/b)^2 = 12, so a^2 is certainly a multiple of 12, but I'm not really convinced a is. are you using an axiom? if so which one or ones ? Thanks! ><
Prove using the multiplication axioms that if x is not zero, then 1 / (1/x) is equal to x.
Prove that there is no rational number, p, such that p^2 = 12
I know for all x there exists x^-1 such that xx^-1 = 1 but i don't know how to use that to prove the first one.
For the second...