Skip to content

Archimedean density when d > 21: a factorial issue #362

Description

@lrnv

The archimedean density when d > 20 uses a factorial(d) that overflows. On the over hand, factorial(big(d)) when d < 20 is very slow.

The tradeoff hould be reconsidered: maybe the compiler got better than in our previous attempts ?

Metadata

Metadata

Assignees

Labels

No labels
No labels

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions