mersenneforum.org  

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

Reply
 
Thread Tools
Old 2017-12-14, 15:36   #12
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

2·32·29 Posts
Default

Now place a decryptive paper.
To see if anyone can solve the problem
Alberico Lepore is offline   Reply With Quote
Old 2017-12-14, 20:20   #13
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

5,987 Posts
Default

We start from a number N which has an unknown factorization N = a*b which we hope to discover. Your first step is computing the square root of (N-n*a)-(2*a-1) = a^2 - 2*a + 1. But we don't know the value of a, so how could we possibly find this?
CRGreathouse is offline   Reply With Quote
Old 2017-12-14, 20:44   #14
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

203428 Posts
Default

Quote:
Originally Posted by Alberico Lepore View Post
Now place a decryptive paper.
To see if anyone can solve the problem
you typo a few words at very least. also the column that's supposed to sum the first column doesn't work out, so I'm lost. I can send you and email if needed for you to respond to this.edit: okay I can partially see how the table gets made.

Last fiddled with by science_man_88 on 2017-12-14 at 20:47
science_man_88 is offline   Reply With Quote
Old 2017-12-14, 20:53   #15
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

52210 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
We start from a number N which has an unknown factorization N = a*b which we hope to discover. Your first step is computing the square root of (N-n*a)-(2*a-1) = a^2 - 2*a + 1. But we don't know the value of a, so how could we possibly find this?
you are genius

https://www.wolframalpha.com/input/?...3D187+,+a%3D11
Alberico Lepore is offline   Reply With Quote
Old 2017-12-14, 21:12   #16
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

135438 Posts
Default

In other words, you'll ask Mathematica/WA to solve a Diophantine quadratic, which will eventually involve factoring the number you set out to factor.
CRGreathouse is offline   Reply With Quote
Old 2017-12-16, 14:29   #17
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

2×32×29 Posts
Default

Hey @CRGreathouse I found a six-nary algorithm that at every level makes a square root.
Is it worth it to implement it?
What is its computational complexity?
It is fully functional.
Alberico Lepore is offline   Reply With Quote
Old 2017-12-16, 15:19   #18
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

20E216 Posts
Default

Quote:
Originally Posted by Alberico Lepore View Post
Is it worth it to implement it?
What is its computational complexity?
It is fully functional.
you could always learn from implementing it, computational complexity can have two parts time and space, which one do you want to know. in this case do you mean functional as it works, or that it is purely based on functions.
science_man_88 is offline   Reply With Quote
Old 2017-12-16, 15:22   #19
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

2·32·29 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
you could always learn from implementing it, computational complexity can have two parts time and space, which one do you want to know. in this case do you mean functional as it works, or that it is purely based on functions.
Given a number N I have a six-nar tree that is, it has six branches and at each level it makes the square root of N.
How many levels of the tree will I have to go down as a function of N?
Alberico Lepore is offline   Reply With Quote
Old 2017-12-16, 15:28   #20
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

20E216 Posts
Default

Quote:
Originally Posted by Alberico Lepore View Post
Given a number N I have a six-nar tree that is, it has six branches and at each level it makes the square root of N.
How many levels of the tree will I have to go down as a function of N?
depends on how many factors you plan on splitting off probably, also depends on how effective the algorithm is at factoring.
science_man_88 is offline   Reply With Quote
Old 2017-12-16, 15:37   #21
Alberico Lepore
 
Alberico Lepore's Avatar
 
May 2017
ITALY

2·32·29 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
depends on how many factors you plan on splitting off probably, also depends on how effective the algorithm is at factoring.
suppose a semi-prime
Alberico Lepore is offline   Reply With Quote
Old 2017-12-16, 15:53   #22
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

100000111000102 Posts
Default

Quote:
Originally Posted by Alberico Lepore View Post
suppose a semi-prime
would then depend on the algorithm. show it to us, if you want the numbers you seek.
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Modifying the Lucas Lehmer Primality Test into a fast test of nothing Trilo Miscellaneous Math 25 2018-03-11 23:20
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
14° Primality test and factorization of Lepore ( conjecture ) Alberico Lepore Alberico Lepore 48 2017-12-30 09:43

All times are UTC. The time now is 19:50.


Wed Feb 8 19:50:12 UTC 2023 up 174 days, 17:18, 1 user, load averages: 0.86, 0.85, 0.90

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.

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