Forum: Programming
2021-10-11, 01:05
|
Replies: 24
Views: 2,979
I think I understood your method. The contents of...
I think I understood your method. The contents of the priority queue and the sorted divisors are the following:
S1 = {1,2,4,8}, S2 = {1,3,9,27}
1,2,4,8 -> 1
3,2,4,8 -> 2
3,6,4,8 -> 3...
|
Forum: Programming
2021-10-10, 20:11
|
Replies: 24
Views: 2,979
|
Forum: Programming
2021-10-10, 17:37
|
Replies: 24
Views: 2,979
|
Forum: Programming
2021-10-08, 16:31
|
Replies: 24
Views: 2,979
|
Forum: Programming
2021-10-05, 21:06
|
Replies: 24
Views: 2,979
At this moment I have a lot of work. I will...
At this moment I have a lot of work. I will continue with this on the weekend.
Notice that the factorial of 100 was just an example. I really need to show the list of divisors of any integer...
|
Forum: Programming
2021-10-04, 11:21
|
Replies: 24
Views: 2,979
|
Forum: Programming
2021-10-04, 03:15
|
Replies: 24
Views: 2,979
|
Forum: Programming
2021-10-04, 01:24
|
Replies: 24
Views: 2,979
|
Forum: Programming
2021-10-04, 00:56
|
Replies: 24
Views: 2,979
From my first post, you can see that I cannot...
From my first post, you can see that I cannot sort the divisors.
There may be millions of divisors, but I have to generate the smallest 1000 of them. After the user presses a button, the program...
|
Forum: Programming
2021-10-04, 00:23
|
Replies: 24
Views: 2,979
Thanks, but it does not help me.
As a test,...
Thanks, but it does not help me.
As a test, I entered:
FORDIV(N)=
{ my(F = factor(N), P = F[,1], E = F[,2]);
forvec(v = vector(#E, i, [0,E[i]]), print(factorback(P, v)));
}
|
Forum: Programming
2021-10-03, 13:57
|
Replies: 24
Views: 2,979
Computing divisors from complete factorization
I would like to generate the divisors of a number from its complete factorization in powers of prime numbers.
It is very easy to generate all of them if I do not need to be sorted, but I would...
|