ˌbodʲɪˈɡrʲim
ˌbodʲɪˈɡrʲim
A prototype can be found in #82.
There are packages [quadratic-irrational](http://hackage.haskell.org/package/quadratic-irrational) and [pell](https://hackage.haskell.org/package/pell) already. However, the first one seems abandoned and I'd prefer to parametrise quadratic irrationals on type level, to avoid partial functions and allow `Num`...
Just for reference, I pushed some commits, reflecting my vision of quadratic rings, to https://github.com/ion1/quadratic-irrational/blob/c58c0fba08272c7e9fdff9fe8e338cff4d766ced/src/Numeric/QuadraticIrrational/Ring.hs
Updated description to confirm with recent directions of development.
@Multramate this is the issue I mentioned today.
> It seems from reading the description above that this issue is meant to implement imaginary quadratic rings, as the real case would probably be harder to do e.g. there...
Here is a draft implementation plan for anyone willing to take a stab: 1. Implement in an efficient way: ```haskell foo :: Int -> [a] -> [[a]] foo k =...
Sounds amazing! Sorry, I am a bit overloaded at the moment, will take a look next week.
This is really beautiful! The choice between first and third implementations of `pascalTriangleTranspose` is the same as for `binomial` (https://github.com/cartazio/arithmoi/blob/master/Math/NumberTheory/Recurrences/Bilinear.hs#L66). The third one looks nicer, but you need to retain...
1. Yeah, it seems reasonable. I am thinking about having (note the difference in constraints) ```haskell binomial :: Num a => [[a]] binomialTransposed :: Num a => [[a]] binomialLine ::...