mersenneforum.org Why this code converge?
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2021-07-29, 18:39 #12 RomanM   Jun 2021 3×17 Posts -How does the refrigerator work? -Grmmmmmmmmmm Old joke. b=mod(u^n,p); a=mod(b^n,p) b^2-a is a multiple of p for any integer n>0, I don't know the behavior of epsilon for every n, but seems that algorithm work only if n=2.
2021-07-29, 18:48   #13
charybdis

Apr 2020

53×7 Posts

Quote:
 Originally Posted by RomanM b=mod(u^n,p); a=mod(b^n,p) b^2-a is a multiple of p for any integer n>0, I don't know the behavior of epsilon for every n, but seems that algorithm work only if n=2.
Try going through the same calculations that I did, but with n=3 and the square roots replaced with cube roots. Can you see where things change?

 2021-07-29, 19:24 #14 RomanM   Jun 2021 638 Posts ) we start from (b-y)^2? For cube, (b-y)^3 must be expanded (b^3-3*b^2*y+3*b*y^2-y^3) and solved in whole by the same manner, without any simplification from the start. And I'm stuck with imaginary parts and 3-roots)) At the same time, cube and highger have solution, just like square!
2021-07-29, 19:55   #15
charybdis

Apr 2020

53×7 Posts

Going back to this:

Quote:
 Originally Posted by Viliam Furik Could you explain, what it is supposed to do, what does it do, and what is the question?
Please can you explain, in full, what your algorithm actually is for higher n? You haven't made it clear which of the squares stay as squares and which change to n-th powers.

What is the question for higher n? Is there even a question?

 2021-07-30, 10:30 #16 RomanM   Jun 2021 3·17 Posts Once again, it's heuristic! There need a genius to shed the light why it work! For higher orders, I have no working code. This is not mean that is impossible.
2021-07-30, 13:14   #17
charybdis

Apr 2020

53·7 Posts

Quote:
 Originally Posted by RomanM Once again, it's heuristic! There need a genius to shed the light why it work!
Yes, it's heuristic, but why do you need a proof? Integer factorization algorithms often have a probabilistic element to them: in the quadratic sieve, how do you know you're actually going to find enough smooth numbers?

You've got the code, you can check whether the heuristic fits the numerical evidence. If you solve my exercise about the expected descent rate from a few posts back, that will give you a hypothesis to test.

 2021-07-30, 18:22 #18 RomanM   Jun 2021 638 Posts First, I dont know whether its well known or new. Second - the spirit of this place! And third, connected with second, plenty of unborn ideas glimpse close to our sight, here I can catch them. Thank You very much for your epsilon!
2021-07-30, 23:11   #19
Batalov

"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

998710 Posts

Quote:
 Originally Posted by RomanM -How does the refrigerator work? -Grmmmmmmmmmm Old joke.
Refrigerator can easily do 'Grmmmmmmmmmm' and not work actually.

Quote:
 Originally Posted by Ilf & Petrov У колодца мадам Боур была приветствована соседом, Виктором Михайловичем Полесовым, гениальным слесарем-интеллигентом, который набирал воду в бидон из-под бензина. У Полесова было лицо оперного дьявола, которого тщательно мазали сажей перед тем, как выпустить на сцену. ... Виктор Михайлович собрался было уже слезть и обревизовать свою загадочную машинку, но она дала вдруг задний ход и, пронеся своего создателя через тот же туннель, остановилась на месте отправления — посреди двора, ворчливо ахнула и взорвалась. Виктор Михайлович уцелел чудом и из обломков мотоцикла в следующий запойный период устроил стационарный двигатель, который был очень похож на настоящий двигатель, но не работал.
Quote:
 Originally Posted by https://translate.google.com/ ... Viktor Mikhailovich was about to get off and turn over his mysterious car, but it suddenly backed up and, carrying its creator through the same tunnel, stopped at the place of departure - in the middle of the yard, gasped gruffly and exploded. Viktor Mikhailovich miraculously survived and from the wreckage of a motorcycle in the next drunken period he arranged a stationary engine, which was very similar to a real engine, but did not work.

2021-07-31, 02:13   #20
Dr Sardonicus

Feb 2017
Nowhere

137208 Posts

Quote:
 Originally Posted by RomanM b=mod(u^n,p); a=mod(b^n,p) b^2-a is a multiple of p for any integer n>0, I don't know the behavior of epsilon for every n, but seems that algorithm work only if n=2.
Do you mean b^n - a?

Another issue arises if n > 2, particularly for odd n > 2. Even if p is prime, if gcd(n, p-1) = 1, every residue mod p is an nth power residue. For n = 3, this is the case for every prime p congruent to 2 (mod 3).

2021-07-31, 15:19   #21
RomanM

Jun 2021

3·17 Posts

Quote:
 Originally Posted by Batalov Refrigerator can easily do 'Grmmmmmmmmmm' and not work actually.
Of course! And quiet too on Peltier elements) This joke mainly about our understanding of life consciousness
Quote:
 Originally Posted by Dr Sardonicus Do you mean b^n - a?
No. Talk was about quadratric case; yes for higher orders.
Quote:
 Originally Posted by RomanM *** Take some integer u>sqrt(p), b=mod(u^2,p); a=mod(b^2,p)=mod(u^4,p); [From (b-y)^2==0 mod p b^2-2*b*y+y^2==0 mod p or a-2*b*y+y^2==0; Solution: y=b-sqrt(b^2-a) (and y=b+sqrt(b^2-a), using first) Make y an integer, and compute t= b-y =ceil(sqrt(b^2-a))] ***
(b-y)^3=b^3-3*b^2*y+3*b*y^2-y^3
if b<sqrt(p) and b^3>p, a=mod(b^3,p)
one roots (of 3)
((-b)^3+a)^(1/3)+b
(b-y)^4
root
(b^4-a)^(1/4)+b
and so on. Other roots also have importance

Last fiddled with by RomanM on 2021-07-31 at 15:23

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Happy5214 YAFU 3 2015-11-01 21:54 daxmick Programming 15 2014-02-14 11:57 Primeinator Software 20 2009-06-11 22:22 IronBits No Prime Left Behind 6 2008-11-12 14:23 jasong Hardware 9 2007-12-22 09:30

All times are UTC. The time now is 16:08.

Thu Dec 1 16:08:16 UTC 2022 up 105 days, 13:36, 1 user, load averages: 1.43, 1.13, 1.03

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.

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