I've got one for you Accounts Shop:
Let's build a bijective function.
Here it is:
f: Z -> R {
f(z) = z * (infinitesimal)
}
infinitesimal = 1/infinity
If you're allowed to put infinity as a number into the function I can use infinity as a number in the function.
Now the reals and the integers have the same cardinality.
inb4 just broke mathematics
notice how i never used infinity as a number when i defined the function f?
i merely gave the general term of the f-function that would allow you to calculate any natural number and show it would be assigned to only one value of 'Z'
also, the f-function you defined is not even a bijective function.
the function is only injective (each value of Z is assigned to a value of R) but not surjective (every value of R can be represented by a value of Z)
for example:
lets say "infinitesimal = 0.005" <we can use a finite value here because although 'infinity' doesn't have a value, it is used as a constant in your definition of the f-function>
so we have
f(-3) = -3/0.005 = -600
f(-2) = -2/0.005 = -400
f(-1) = -1/0.005 = -200
f(0) = 0/0.005 = 0
f(1) = 1/0.005 = 200
f(2) = 2/0.005 = 400
f(3) = 3/0.005 = 600
since 'Z' is the set of integers, the f-function does not represent every 'R' and thus f is not surjective
however, to be bijective, a function needs to be Injective
and Surjective.
Thus, |Z| != |R| which makes sense, because 'Z' is countable whereas 'R' is not
let's do the same test with the f-function i built:
f(a) = a/2 <if 'a ' is pair>
f(a) = -(a+1)/2 <if 'a' is impair>
f(0) = 0/2 = 0
f(1) = -(1+1)/2 = -1
f(2) = 2/2 = 1
f(3) = -(3+1)/2 = -2
f(4) = 4/2 = 2
f(5) = -(5+1)/2 = -3
f(6) = 6/2 = 3
...
if we continue to infinity, each value of 'a' will have been assigned to one and only one value of 'Z', and each value of 'Z' will be assigned to one and only one 'a' thus proving that the f-function is in fact a bijective function which then means that |N| = |Z|