How is a sequence of probes a permutation in double hashing?

Question

Algorithms

Hello, I can't understand. Let's say there is a double hashing h(k,i)=(h1(k)+i*h2(k)) mod n. There is a statement that the sequence of samples corresponding to the key k is a permutation of the set {0,1,...,n-1} if and only if h2(k) is relatively prime to n. Please give at least 1 example to make the statement true.

Answer 1

What's easier. Let n==2^t, this is usually the case. Then h2(k)==2*k+1 is an odd number that is always relatively prime to n.
Plug in and check.

Answer 2

I can only note the beginning of acquaintance with this area (then everything started by itself)
As a hobby, I mastered 3dsMax back in 2008 using these magazines - Render Magazines
I use this stack as a hobby, if you grow in this area, then in a good workplace, the skill will grow order faster.

Answer 3

An excellent, in my opinion, course on 3D modeling on Blender: https://www.youtube.com/watch?v=HSGz9z9nIBk&list=P...

Answer 4

You need to start by downloading the 3D editor! preferably in Russian :)
and perform all sorts of manipulations with ready-made models

Answer 5

I recommend the Belarusian game design school Polygon. 3d modeling course https://polygon.by/course/3d-artist