mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math > Number Theory Discussion Group

Reply
 
Thread Tools
Old 2023-05-26, 12:05   #12
Drdmitry
 
Drdmitry's Avatar
 
Nov 2011

3×107 Posts
Default

Quote:
Originally Posted by chris2be8 View Post
@Drdmitry, do you have a program or sample code to find factors of k*x^n+/-c numbers? I'm running a script that goes through composite numbers in factordb and adds algebraic factors factordb doesn't know of.

I do all cases of x^n+/-1 (aided by cyclo from http://myfactors.mooo.com/) and cases based on x^4n+4. Code to find factors of other cases such as those mentioned in your paper would be much appreciated.

A few random examples from factordb:
Code:
(2^6641+164851)/282543099
(10^2010*96+48241)/7605585604532904186851
(2^6641+165859)/266786301
(14438^482+1)/504187357817065
(((((((((((((((2^6900*1401+1)/202127314336553+1)/90-1)/3946751904+1)/1221828-1)/30-1)/1439676372+1)/4+1)/23994+1)/234-1)/20+1)/1848-1)/15227632858125752880-1)/25220-1)/2-1)/225100232050
There are quite a lot like the last number, but I doubt they can be factored.
No, I do not. Sorry.

Last fiddled with by Drdmitry on 2023-05-26 at 12:05
Drdmitry is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
My p^11-1 fully factorisations MisterBitcoin MisterBitcoin 0 2018-07-24 15:50
Cyclotomic primes (degree>=5) Batalov And now for something completely different 0 2016-06-21 21:02
Cyclotomic Polynomial Factoring methods mickfrancis Factoring 2 2015-01-11 18:31
Cyclotomic Phi plandon Math 22 2009-07-29 18:59
Multiplication in cyclotomic rings wpolly Programming 1 2009-01-23 22:08

All times are UTC. The time now is 10:04.


Sat Sep 23 10:04:09 UTC 2023 up 10 days, 7:46, 0 users, load averages: 1.39, 1.25, 1.20

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.

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