mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > Alberico Lepore

Reply
 
Thread Tools
Old 2017-12-28, 07:35   #45
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

2·32·29 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
If it depends on the number, it's not a constant. What kind of dependency does it have?
if I'm not mistaken if N = a ^ 2 + n * a without repetitions goes from 1 to a / (2 * n)
Alberico Lepore is offline   Reply With Quote
Old 2017-12-28, 07:40   #46
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

233518 Posts
Default

Quote:
Originally Posted by Alberico Lepore View Post
if I'm not mistaken if N = a ^ 2 + n * a without repetitions goes from 1 to a / (2 * n)
Do you mean you have an algorithm which checks if N=a*(a+n) is prime?
LaurV is offline   Reply With Quote
Old 2017-12-28, 08:34   #47
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

2·32·29 Posts
Default

Quote:
Originally Posted by LaurV View Post
Do you mean you have an algorithm which checks if N=a*(a+n) is prime?
I had never thought about it.
Give me a few minutes to think about it
Alberico Lepore is offline   Reply With Quote
Old 2017-12-28, 11:48   #48
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

2·32·29 Posts
Default

Quote:
Originally Posted by LaurV View Post
Do you mean you have an algorithm which checks if N=a*(a+n) is prime?
thank you,
you pointed out to me that I was wrong
it is 2 ^ X, X with repetitions
but I do not give up
Alberico Lepore is offline   Reply With Quote
Old 2017-12-30, 09:43   #49
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

10128 Posts
Default

The algorithm that I show you is in X with repetitions, if you want to apply the variant of log_2, you will have X * log_2 () with X without repetitions.

For Z we are interested if you admit solutions or not
For others we must test whether the parent's product difference is the same but opposite sign from that of the child
Example

CHECK Z

[1135793-2*a^2]=-Z , Z=-a*(a-n) , a^2+n*a=1135793 YES solution bad way , Z is positive

[1135793-2*a^2]=Z , Z=-a*(a-n) , a^2+n*a=1135793 NO solution good way


CHECK Q

[1135793-2*a^2]=Z , Z=-a*(a-n), Z-2*(a)^2=-[a*[(a)-(-(a-n)-(a))]]=A , a^2+n*a=1135793

[1135793-2*a^2]=Z , Z=-a*(a-n), Z-2*(a-n)^2=-[(-(a-n))*[-(a-n)-(a-(-(a-n)))]]=B , a^2+n*a=1135793

[-[(a)-(-(a-n)-(a))]-a]=-((a-n)-(a)) , a^2+n*a=1135793 There are no solutions are different then Q = A

-[a*[(a)-(-(a-n)-(a))]]=a*(-(3*a-n))=Q


CHECK R

Q-2*a^2=[a*(-(3*a-n))]-2*a^2=-[a*[a-(-(3*a-n)-a)]]=A , a^2+n*a=1135793

Q-2*(-(3*a-n))^2=-[(-(3*a-n))*[(-(3*a-n))-(a-(-(3*a-n)))]]=B , a^2+n*a=1135793

[-[a-(-(3*a-n)-a)]-a]=-[[(a)-(-(a-n)-(a))]-a] , a^2+n*a=1135793 There are no solutions are different then R = A

-[a*[a-(-(3*a-n)-a)]]=a*(-5*a+n)=R


CHECK T

R-2*a^2=-[a*[a-((-5*a+n)-a)]]=A , a^2+n*a=1135793

R-2*(-5*a+n)^2=-[(-5*a+n)*[(-5*a+n)-(a-(-5*a+n))]]=B , a^2+n*a=1135793

[(-5*a+n)-a]=-[[a-((-5*a+n)-a)]-a] , a^2+n*a=1135793 TRUE they are the same, better to say they are opposite then T = B

-[(-5*a+n)*[(-5*a+n)-(a-(-5*a+n))]]=(-5*a+n)*(-11*a+2*n)=T


etc.etc.




Does anyone confirm me the accuracy of the algorithm?
Alberico Lepore is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Primality test based on factorization of n^2+n+1 carpetpool Miscellaneous Math 5 2018-02-05 05:20
20th Test of primality and factorization of Lepore with Pythagorean triples Alberico Lepore Alberico Lepore 43 2018-01-17 15:55
18th Test of primality and factorization of Lepore in 5 * log_25 (N) (New Year's algorithm) Alberico Lepore Alberico Lepore 2 2018-01-01 21:31
Factorization and primality test O([log_9(N)]^3) Alberico Lepore Alberico Lepore 26 2017-12-17 18:44
Lepore Factorization in O(k) Conjecture Alberico Lepore Alberico Lepore 61 2017-09-23 21:52

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


Thu May 19 22:46:55 UTC 2022 up 35 days, 20:48, 0 users, load averages: 1.33, 1.16, 1.21

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.

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