mersenneforum.org  

Go Back   mersenneforum.org > Search Forums
Reload this Page Search Results
Register FAQ Search Today's Posts Mark Forums Read

Showing results 1 to 7 of 7
Search took 0.01 seconds. Search: Posts Made By: a1call
Forum: Programming 2021-10-05, 14:13
Replies: 24
Views: 2,916
Posted By a1call
Not sure if you are still interested alpertron,...

Not sure if you are still interested alpertron, but FTR, the code in post number 13 can be generalized to give results for factorials which are too large to be calculated. :smile:
Forum: Programming 2021-10-04, 15:29
Replies: 24
Views: 2,916
Posted By a1call
Here is an alternative that is probably the most...

Here is an alternative that is probably the most practical for the factorials in particular as long as they can be calculated. :smile:




\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
f=100!
...
Forum: Programming 2021-10-04, 03:18
Replies: 24
Views: 2,916
Posted By a1call
I chose 23! not 100!. It takes too long to go...

I chose 23! not 100!. It takes too long to go through all the divisors. You can try changing the factorialFace variable to 100 if you are willing to wait ? period of time. :smile:
Forum: Programming 2021-10-04, 03:03
Replies: 24
Views: 2,916
Posted By a1call
I am a slow coder, but to get my point across...

I am a slow coder, but to get my point across here is a dirty, inefficient and incomplete code.

Pari-gp code:



\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
factorialFace=23
theregister=100
theThou...
Forum: Programming 2021-10-04, 01:05
Replies: 24
Views: 2,916
Posted By a1call
Knowing all the prime factors and their...

Knowing all the prime factors and their recurrence cannot give you sorted divisors without sorting or brute force for general/arbitrary cases.

Not sure what scenario would not have any memory at...
Forum: Programming 2021-10-04, 00:47
Replies: 24
Views: 2,916
Posted By a1call
You can use fordiv() to get sorted results but...

You can use fordiv() to get sorted results but you will be limited by amount of memory that can store the divisors. If you use the memory limiting function then you will have to sort the results...
Forum: Programming 2021-10-03, 16:05
Replies: 24
Views: 2,916
Posted By a1call
Pari-gp code: fordiv(5!, X, print(X)) ...

Pari-gp code:

fordiv(5!, X, print(X))




1
2
3
Showing results 1 to 7 of 7

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


Thu Feb 2 17:58:11 UTC 2023 up 168 days, 15:26, 1 user, load averages: 1.31, 1.17, 1.10

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.

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