mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 11 of 11
Search took 0.01 seconds.
Search: Posts Made By: alpertron
Forum: Programming 2021-10-11, 01:05
Replies: 24
Views: 2,916
Posted By alpertron
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,916
Posted By alpertron
If you press the button Show more divisors you...

If you press the button Show more divisors you will see the divisor 7 in the second batch.

My application sorts the results inside batches.

The number 18! has 14688 divisors. The application...
Forum: Programming 2021-10-10, 17:37
Replies: 24
Views: 2,916
Posted By alpertron
I've just uploaded a new version of the Integer...

I've just uploaded a new version of the Integer Factorization Calculator (https://www.alpertron.com.ar/ECM.HTM) that includes the list of divisors. Each batch of 1000 factors is sorted using...
Forum: Programming 2021-10-08, 16:31
Replies: 24
Views: 2,916
Posted By alpertron
The algorithm posted to Stack Overflow requires...

The algorithm posted to Stack Overflow requires that all the divisors are present in memory. So it is not useful for me.

I will show unsorted divisors in my Web application. If the number of...
Forum: Programming 2021-10-05, 21:06
Replies: 24
Views: 2,916
Posted By alpertron
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,916
Posted By alpertron
I asked this problem in another forum and someone...

I asked this problem in another forum and someone pointed to https://stackoverflow.com/questions/29992904/enumerate-factors-of-a-number-directly-in-ascending-order-without-sorting . I will analyze...
Forum: Programming 2021-10-04, 03:15
Replies: 24
Views: 2,916
Posted By alpertron
All numbers between 1 and 100 are divisors of...

All numbers between 1 and 100 are divisors of 100! but it appears that there are missing divisors in your list.
Forum: Programming 2021-10-04, 01:24
Replies: 24
Views: 2,916
Posted By alpertron
Ok. Let's use an example: the number is 100! I...

Ok. Let's use an example: the number is 100! I know its complete factorization.

I want to show the first 1000 divisors, then the next 1000 divisors and so on.
Forum: Programming 2021-10-04, 00:56
Replies: 24
Views: 2,916
Posted By alpertron
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,916
Posted By alpertron
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,916
Posted By alpertron
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...
Showing results 1 to 11 of 11

 
All times are UTC. The time now is 17:22.


Thu Feb 2 17:22:44 UTC 2023 up 168 days, 14:51, 1 user, load averages: 0.55, 0.72, 0.86

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔