Non-Bijective Function from Integers to Integers

  • Thread starter Thread starter playa007
  • Start date Start date
  • Tags Tags
    Function Integers
playa007
Messages
25
Reaction score
0

Homework Statement


Is it possible to find a non-bijective function from the integers to the integers such that:
f(j+n)=f(j)+n where n is a fixed integer greater than or equal to 1 and j arbitrary integer.

Homework Equations





The Attempt at a Solution

 
Physics news on Phys.org
Good question. But the rules of the forum say you have to at least try to find a solution before anyone can help.
 
I haven't considered the possibility that the condition f(j+n)=f(j)+n forces bijectivity. But clearly the condition implies a bunch of things would not work: nothing of the form f(j)=mj where m>1, floor/ceiling functions, any functions which are constant between two integers,...
 
What happens if n=1? Then think about n=2.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top