Timeline for Algorithm to compute a common denominator of a finite set of rational numbers
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 11, 2014 at 14:08 | comment | added | Daniel Gerigk | The motivation for this question can be found here. | |
| Jul 11, 2014 at 10:38 | comment | added | Daniel Gerigk | Would it help if we knew a constant $C \in \mathbb{N}$ such that there is $N \in \{1,\dots,K\}$ such that $x_1 N,\dots,x_n N \in \mathbb{Z}$ and all prime factors of $N$ are smaller than $C$? | |
| Jul 11, 2014 at 10:32 | comment | added | Daniel Gerigk | At the moment I only have brute force. Anything better would be helpful. | |
| Jul 11, 2014 at 10:26 | comment | added | Loïc Teyssier | How «efficient» should it be? What is the complexity you have at your disposal right now? | |
| Jul 11, 2014 at 10:24 | history | asked | Daniel Gerigk | CC BY-SA 3.0 |