mersenneforum.org  

Go Back   mersenneforum.org > Math Stuff > Computer Science & Computational Number Theory

Reply
 
Thread Tools
Old 2014-11-28, 14:51   #1
Drdmitry
 
Drdmitry's Avatar
 
Nov 2011

22×3×23 Posts
Default Finding all divisors kn + 1 of P(n) for various polynomials P

Let P(x)\in Z[x] be a monic polynomial with such that x^nP(-x^{-1}) = P(x). I was interested in looking at the divisors of the values P(n) of the form kn+1. It appears that, given one divisor
n_0n_1+1 | P(n_1),
there is an infinite series of the divisors of this form which is given by the equations
P(n_k) = (n_{k-1}n_k+1)(n_{k+1}n_k+1).
For the polynomial P(n) = n^4 + 1 one can classify all such series. They are "generated" by the pairs (n_0, n_1) = (0, n) for an arbitrary n\in N. This in turn implies (with some efforts to be made) that numbers b^{4m}+1 do not have (non-algebraic) divisors of the form kb^m + 1.

Concerning the polynomial P(n) = n^8 + 1 we also have series of divisors of P(n) generated by the pairs (n_0, n_1) = (0,n). Additionally the pairs (n_0, n_1) = (n^3, n^5) generate infinite series of divisors of P(n). However a basic search among small numbers shows that there are still "exceptional" pairs (n_0,n_1) which generate the divisors n_0n_1+1 | n_1^8 + 1, the smallest of them is (3,11). With some efforts one can check that all (non-algebraic) divisors kb^m+1 of numbers b^{8m}+1 must come from an "exceptional" pair (k,b^m).

I do not know how to classify the "exceptional" pairs (n_0, n_1). I conducted a search for all pairs with \max\{n_0,n_1\} \le 10^6 and additionally with n_0+n_1\le 10^7. In total there are 201 different infinite series found. Also it seems that they are more less equidistributed on a \log n_0 \times \log n_1 coordinate plane.

It would be very interesting to find a way to classify all of the exceptional pairs (n_0,n_1). In particular it may give us all divisors kb^m + 1 of numbers b^{8m}+1.
Attached Files
File Type: pdf spec_fact.pdf (199.9 KB, 192 views)
File Type: txt x^8+1_chains.txt (10.3 KB, 256 views)
Drdmitry is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Looking for fermat divisors, n=90-120 firejuggler Prime Sierpinski Project 2 2012-01-10 17:14
Density of Mersenne divisors Random Poster Math 1 2008-12-15 01:14
odd divisors of Mersenne-like, question stpascu Factoring 1 2006-10-16 16:31
Number of divisors of n? Citrix Math 10 2006-02-08 04:09
alright Fermat divisors, ya can run.... ixfd64 Lounge 9 2004-05-27 05:42

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


Tue May 17 10:13:38 UTC 2022 up 33 days, 8:14, 0 users, load averages: 1.23, 1.03, 1.00

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

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