Show that there does not exist a function $f:\mathbb N\to \mathbb N$ which satisfy
a) $f(2) = 3$
b) $f(mn) = f(m)\cdot f(n)$ for all $m,n \in \mathbb N$
c) $f(m) < f(n)$ whenever $m < n$
Subscribe to:
Post Comments (Atom)
real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
Ok, according to some notes I have, the following is true for a random variable $X$ that can only take on positive values, i.e $P(X<0=0)$...
-
The question said: Use the Euclidean Algorithm to find gcd $(1207,569)$ and write $(1207,569)$ as an integer linear combination of $1207$ ...
No comments:
Post a Comment