mersenneforum.org Factor Found P-1 Question
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2021-08-16, 01:18 #1 LOBES   Mar 2019 USA 73 Posts Factor Found P-1 Question I don't find many factors using P-1, but when I do I always find it interesting. I have a question when looking at the results: See: https://www.mersenne.ca/exponent/107731187 In the "P-1 results:" section, where it says "bits (76.408)", does this mean that if someone had simply TF'ed it from 76-77 that it would have found that same factor?
 2021-08-16, 01:52 #2 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 29×353 Posts That is correct.
 2021-08-16, 02:27 #3 Zhangrc   "University student" May 2021 Beijing, China 3×67 Posts I've even found a factor like this. M107599963 has a factor: 118142113851371427649409 (76.645 bits) k: 2^6 × 83 × 179 × 13187 × 43783 I TFed to find this one, but it's really P-1-smooth
2021-08-16, 02:58   #4
LOBES

Mar 2019
USA

10010012 Posts

Quote:
 Originally Posted by Uncwilly That is correct.
Thanks...because when I look at one like this:

https://www.mersenne.ca/exponent/107934373

And I see bits is 122.960, I think "Damn, that would take a LONG time to TF".

 2021-08-16, 04:47 #5 kriesel     "TF79LL86GIMPS96gpu17" Mar 2017 US midwest 2·33·113 Posts It takes quite a lot of P-1 to get one or more in the top 100 (>131.75 bits) of https://www.mersenne.ca/userfactors/pm1/1/bits
2021-08-16, 22:25   #6
masser

Jul 2003
Behind BB

1,801 Posts

Quote:
 Originally Posted by kriesel It takes quite a lot of P-1 to get one or more in the top 100 (>131.75 bits) of https://www.mersenne.ca/userfactors/pm1/1/bits
or quite a lot of luck

2021-08-17, 02:12   #7
LaurV
Romulan Interpreter

"name field"
Jun 2011
Thailand

268C16 Posts

Quote:
 Originally Posted by Uncwilly That is correct.
Indeed. All x.zzzz bits factors found by P-1 will be found also by TF, if you TF from x to x+1 bits.

However, viceversa is not true. If you find a factor by TF from x to x+1 bits, this factors will be found by suitable P-1 to some B1/B2 limit, only if the factors is B1/B2 smooth.

TF finds all factors between x and x+1 bits (unless you stop after the first factor found, obviously).

P-1 finds only "smooth" factors, regardless of their "bit" size.

So, the two methods have a non-void intersection, and a non-void non-intersection (i.e. there exist factors that will be found by both methods, and there exists factors that are very easy to find by one method, but close-to-impossible to find with the other - otherwise we won't use both methods here).

Last fiddled with by LaurV on 2021-08-17 at 02:17

 Similar Threads Thread Thread Starter Forum Replies Last Post tha Data 65 2020-08-05 21:11 johnadam74 FermatSearch 16 2016-11-03 12:10 NBtarheel_33 GPU Computing 11 2012-04-07 21:12 tha Factoring 4 2007-06-18 19:56 jocelynl Software 6 2004-08-07 01:31

All times are UTC. The time now is 14:49.

Fri Jan 21 14:49:38 UTC 2022 up 182 days, 9:18, 0 users, load averages: 1.06, 1.19, 1.32

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.

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