-
We should prove the fundamental theorem of arithmetic for `nat` and `IsPrime`. The basic statement says that any given `nat` has a factorisation and any two factorisations are unique up to a permutati…
-
This URL:
http://localhost:5173/?name=Formula&viz=FactorFence&highlight=17&seq=Formula&formula=2%5En-1&first=1
Produces this erroneous image (factorizations are wrong from the 54th term onward):
!…
-
Multiplicative functions (such as `number_of_divisors()`, `sigma()`, `divisors()` etc.) can be easily computed for factored integers, but they are not defined for `Factorization` objects. This ticke…
-
Currently the modulus of the polynomial factorization calculator must be a prime number or a power of a prime, but I think that a general composite number modulus should be possible, e.g. for a polyno…
-
From an example reported on the support list:
```
gap> Factors(998582188058818939);
Error, no method found! For debugging hints type ?Recovery from NoMethodFound
Error, no 1st choice method foun…
-
The prime factorization performed by `factorint` does not cache results. This leads to performance degradation when factorizing the same natural numbers multiple times. However, the amount of data to …
-
Right now the code will not call pari to factor numbers larger than 2^200 (in `flaskr/nscope/views.py`). (Larger terms return `no_fac`.) These numbers are all factorable nearly immediately (depending…
-
Does this sieve variant that computes a full factorization by extracting primes from numbers have a name? It's not as good as the linear sieve but gives the factorization directly. The time complexity…
-
Currently, for the integer factorization calculator, "Prime" (primality testing) only uses the Baillie-PSW probable primality testing (a probable primality testing, i.e. they _might_ be pseudoprimes) …
-
Our first circuits fundamentals problem : - )
Inspiration:
> For the circuit shown in the figure above, what is the current i through the 2 ohm resistor?
> (A) 2A
> (B) 4A
> (C) 5A
> (D) 10A
…