meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 8 months |
| seen | Apr 21 at 19:37 | |
| stats | profile views | 43 |
|
Nov 30 |
comment |
Faster arithmetic with finite continued fractions ok then I'll try chatting tommorow then. |
|
Nov 30 |
comment |
Faster arithmetic with finite continued fractions let us continue this discussion in chat |
|
Nov 30 |
comment |
Faster arithmetic with finite continued fractions @MJD tyvm, I already have, I reimplemented it in python too. |
|
Nov 30 |
comment |
Faster arithmetic with finite continued fractions @MJD oh wow, you are the author, I am honored you commented. I actually have a followup to this question, about how the mass absorption/emmision works in Heckmann's paper. Perhaps you can make a slideshow on that next ;). |
|
Nov 30 |
answered | Faster arithmetic with finite continued fractions |
|
Nov 30 |
comment |
Faster arithmetic with finite continued fractions @MJD I think I wanted a written out example of the $\left\langle \frac {a \space b \space c \space d}{e \space f \space g \space h} \right\rangle$ like he had for $\left\langle \frac {a \space b}{c \space d} \right\rangle$. |
|
Nov 13 |
comment |
CRT representation of integers, and multiplication in (almost) linear time I found the name of this number system, its called the residue number system. As for your comparison scheme, I think it fails because $\sqrt x \mod M$ has many possible answers. If $M$ is prime, then it has two answers, and if $M$ is made of $n$ coprime numbers, then it will have up to $2^n$ possible answers, I think. |
|
Nov 8 |
awarded | Custodian |
|
Nov 8 |
reviewed | Reviewed Convert a n by n matrix to upper triangular |
|
Nov 8 |
revised |
CRT representation of integers, and multiplication in (almost) linear time added 2 characters in body |
|
Nov 8 |
asked | CRT representation of integers, and multiplication in (almost) linear time |
|
Nov 7 |
revised |
Faster arithmetic with finite continued fractions Added some links to CF arithmetic |
|
Nov 7 |
asked | Faster arithmetic with finite continued fractions |
|
Sep 19 |
accepted | How to remove linearly dependent rows/cols |
|
Sep 19 |
comment |
How to remove linearly dependent rows/cols Cool, and why is it not possible to reduce the rows instead? Since row-rank and column-rank are equal? |
|
Sep 19 |
asked | How to remove linearly dependent rows/cols |
|
Sep 14 |
awarded | Organizer |
|
Sep 14 |
revised |
What is your favorite online graphing tool? Added tag. |
|
Sep 14 |
comment |
How many multiples of two primes equal eachother Added the non-zero constraint, ty. |
|
Sep 14 |
revised |
How many multiples of two primes equal eachother Added non-zero constraint. |
