Skip to main content

Timeline for Hilbert Numbers

Current License: CC BY-SA 3.0

9 events
when toggle format what by license comment
Oct 3, 2017 at 16:41 vote accept Ahmad
May 20, 2017 at 21:12 answer added Max Alekseyev timeline score: 3
May 19, 2017 at 16:11 answer added Christian Elsholtz timeline score: 20
May 18, 2017 at 21:33 comment added Ahmad @René I managed to prove that if $n$ is $-d \mod 4m-1$ such that $d|m$ and $m \geq 1$ then $n$ is sure a Hilbert Number, also every number of the form : $4k+2$,$8k+5$,$12k+8$,$16k+15$ for $k \geq 0$. then $n$ is a Hilbert Number, but the problem with my approach is that i look for patterns in modular arithmetic which i highly doubt that it will provide a complete answer(i may be wrong).
May 18, 2017 at 10:54 comment added R.P. Intriguing question. It sometimes helps if you explain where the problem came from. Also, what were your own ideas to attack this problem? And do you have any observations which may be useful? As for me, I am faintly reminded of the famous sixth problem of the 1988 IMO.
May 17, 2017 at 23:56 comment added Ahmad @IgorRivin I called them this name because i like David Hilbert, they are numbers with the conditions stated above
May 17, 2017 at 23:21 comment added Gerry Myerson Also posted to m.se, math.stackexchange.com/questions/2285274/hilbert-numbers without notice to either site. Please don't do that.
May 17, 2017 at 22:49 comment added Igor Rivin This nomenclature seems to disagree with wikiwand.com/en/Hilbert_number
May 17, 2017 at 22:41 history asked Ahmad CC BY-SA 3.0