mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Data

Reply
 
Thread Tools
Old 2009-07-13, 16:42   #34
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Liverpool (GMT/BST)

37·163 Posts
Default

Quote:
Originally Posted by 10metreh View Post
1 is the smallest factor of any whole number.
it is not the smallest prime factor however
henryzz is offline   Reply With Quote
Old 2009-07-13, 16:54   #35
10metreh
 
10metreh's Avatar
 
Nov 2008

1001000100102 Posts
Default

Quote:
Originally Posted by henryzz View Post
it is not the smallest prime factor however
Yes, but the gang were talking about the "smallest factor of a number". This is actually 1, but they were using it as the "smallest prime factor".

I notice that my posts in threads that are not in the Factoring Projects superforum often have the effect of drastically reducing the posting rate in that thread. What is the reason for this?

Oh yes, and I have guessed what everyone's reactions will be
10metreh is offline   Reply With Quote
Old 2009-07-13, 17:10   #36
TimSorbet
Account Deleted
 
TimSorbet's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

11·389 Posts
Default

Of course, trivially every natural number over 1 has at least two factors: 1 and itself. With Mersenne numbers these correspond to k=0 and k=(Mp-1)/2p, respectively. But it makes sense to restrict our search to k's such that 0<k<(Mp-1)/2p.
Saying that 1 and Mp qualify just because we didn't specify prime factor is just being pedantic, and you know it.

Last fiddled with by TimSorbet on 2009-07-13 at 17:12 Reason: "every number has" > "every natural number over 1 has" so as to avoid any more pedantry :)
TimSorbet is online now   Reply With Quote
Old 2009-07-13, 21:51   #37
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

769210 Posts
Default

Quote:
Originally Posted by 10metreh View Post
I notice that my posts in threads that are not in the Factoring Projects superforum often have the effect of drastically reducing the posting rate in that thread. What is the reason for this?
Correlation is not causation. Maybe you're just habitually late to get into the discussions outside Factoring Projects. :-)
cheesehead is offline   Reply With Quote
Old 2009-07-17, 02:52   #38
MatWur-S530113
 
MatWur-S530113's Avatar
 
Apr 2007
Spessart/Germany

2×83 Posts
Default

Quote:
Originally Posted by plandon View Post
The biggest known smallest k is (M42643801-1)/(2*42643801)

This thread is interesting.
What is the average k? How often is k=1?
or where is the data so that I can average it myself?
A factor of a Mersennenumber has k=1 if and only if the prime exponent p is a Sophie Germain prime (then 2p+1 is prime, too) congruent 3 mod 4.

It is not known wheather there are infinity many SG primes or not.

best regards,

Matthias
MatWur-S530113 is offline   Reply With Quote
Old 2009-07-17, 05:39   #39
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

22·7·389 Posts
Default

Quote:
Originally Posted by MatWur-S530113 View Post
A factor of a Mersennenumber has k=1 if and only if the prime exponent p is a Sophie Germain prime (then 2p+1 is prime, too) congruent 3 mod 4.
In the range of 332192831 - 332399999 there are 347 with k=1.
Uncwilly is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Largest Known PRP a1call Probability & Probabilistic Number Theory 32 2017-11-29 13:59
Largest known prime Unregistered Information & Answers 24 2008-12-13 08:13
Largest 64 bit prime? amcfarlane Math 6 2004-12-26 23:15
largest factor ,i think. heryu Miscellaneous Math 10 2004-09-08 11:15
need Pentium 4s for 5th largest prime search (largest proth) wfgarnett3 Lounge 7 2002-11-25 06:34

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


Fri Feb 3 13:11:29 UTC 2023 up 169 days, 10:40, 1 user, load averages: 1.35, 1.10, 0.96

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.

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