SHOW that the set of algebraic numbers is countable.
SHOW that nonalgebraic numbers exist...not every complex
number equals to root of a polynomial with
integer coefficients.
HOMEWORK: Suppose |S| = m and |T| = n. How many injective
functions are there from S to T? Can you find a formula or
an algorithm for computing this...with justificiation?
How about surjective?
Bijective?
Find injections from P(N) to the reals, and from the reals to P(N)
I can answer these questions for you. I'm a physicist, with a PhD on theoretical physics and a very strong mathematical background. I've spent 4 years as a post-doctoral researcher in two of the best academic institutions in north america.
Hello
I just finished the first year of math studies and I had the best grade on Discrete Mathematics which subject's main topick were:
Sets and the countability of them
Functions
Graphs etc.
I think You would be pleased working with me.