Timeline for How does taking modulo 1 make sense?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 19, 2013 at 5:57 | comment | added | Parag | What I think he used this hash function because after solving decimal part is changing even for small change in number , I am still not sure but it seems it will give less number of collision. | |
| Nov 18, 2013 at 21:42 | comment | added | Raphael | @p.j Note that the common definition for modulo does not need that any of the numbers is integer: $a \mod b = c \iff \exists k \in \mathbb{Z}.\ a - bk = c$. (Typically, one requires $c < b$ to get a well-defined operation, but in mathematics modulo is used as a relation.) | |
| Nov 18, 2013 at 21:27 | comment | added | Parag | ok thanks this was the first time I came across mod for non integer.So What is the final mapping. | |
| Nov 18, 2013 at 21:22 | history | answered | D.W.♦ | CC BY-SA 3.0 |