 mersenneforum.org > Math Mersenne Conjecture
 Register FAQ Search Today's Posts Mark Forums Read  2010-05-03, 14:04 #12 Gammatester   Mar 2009 468 Posts Although English is not my native langage, I think your Proposition 1: Code: If M_p is not prime, when this is true: phi(M_p) = 0 mod p^2 should read Code: If M_p is not prime, then this is true: phi(M_p) = 0 mod p^2. But M_4 = 15 is a counterexample because phi(15) mod 16 = 8. Or am I missing something here, e.g. that p should be prime?   2010-05-03, 14:25   #13
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

22×1,877 Posts Quote:
 Originally Posted by Gammatester Although English is not my native langage, I think your Proposition 1: Code: If M_p is not prime, when this is true: phi(M_p) = 0 mod p^2 should read Code: If M_p is not prime, then this is true: phi(M_p) = 0 mod p^2. But M_4 = 15 is a counterexample because phi(15) mod 16 = 8. Or am I missing something here, e.g. that p should be prime?
If p is prime, the conjecture is true and TRIVIAL.

Given N = 2^p-1, and N is composite then N is the product of at least two
primes, each of which is 1 mod p. phi(N) will be divisible by p^k, where
k is the number of distinct prime factors of N.

This does not merit calling it a 'conjecture'. It is an elementary homework
problem that one might assign to a beginning number theory class.   2010-05-07, 06:08   #14
sascha77

Jan 2010
germany

2×13 Posts Quote:
 Originally Posted by R.D. Silverman If p is prime, the conjecture is true and TRIVIAL. Given N = 2^p-1, and N is composite then N is the product of at least two primes, each of which is 1 mod p. phi(N) will be divisible by p^k, where k is the number of distinct prime factors of N. This does not merit calling it a 'conjecture'. It is an elementary homework problem that one might assign to a beginning number theory class.
Hello Silverman, Yes i mean that p must be Prime. M_p is the abbreviation of Mersenne-number with p prime. Thank you, that you showed me, that Proposition 1 is trivial. But it was not the conjecture , the conjecture is in top of the pdf. (Conjecture 1) And I showed that proposition1 is true, because i need this for example in proposition5. And I wasnt shure if everybody see the Proposition1 is trivial. So I simply showed that this is true. I have question to you: Let M_p be a Mersenne-PRIME Number (M_p is Prime). When it has the form : M_p = 2^p-1 = 2*k*p+1 , with k is natural number. Can you show that k==0 (mod p) is always false. Perhaps it is also trivial, I do not know. Sascha   2010-05-07, 11:09   #15
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

11101010101002 Posts Quote:
 Originally Posted by sascha77 Hello Silverman, Yes i mean that p must be Prime. M_p is the abbreviation of Mersenne-number with p prime. Thank you, that you showed me, that Proposition 1 is trivial. But it was not the conjecture , the conjecture is in top of the pdf. (Conjecture 1) And I showed that proposition1 is true, because i need this for example in proposition5. And I wasnt shure if everybody see the Proposition1 is trivial. So I simply showed that this is true. I have question to you: Let M_p be a Mersenne-PRIME Number (M_p is Prime). When it has the form : M_p = 2^p-1 = 2*k*p+1 , with k is natural number. Can you show that k==0 (mod p) is always false. Perhaps it is also trivial, I do not know. Sascha
Repeat after me: Google is my friend.

Look up "Wieferich"   2010-05-08, 00:33 #16 cheesehead   "Richard B. Woods" Aug 2002 Wisconsin USA 22·3·641 Posts Also, Mathworld (http://mathworld.wolfram.com/) is your mathematical friend, usually. http://mathworld.wolfram.com/search/...erich&x=10&y=9   Thread Tools Show Printable Version Email this Page Similar Threads Thread Thread Starter Forum Replies Last Post ATH Math 28 2021-08-05 05:50 bhelmes Number Theory Discussion Group 0 2017-07-28 20:34 sascha77 Math 2 2010-01-07 08:06 Dougy Math 32 2008-10-26 07:17 olivier_latinne Math 54 2008-03-12 10:04

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

Tue Feb 7 22:00:05 UTC 2023 up 173 days, 19:28, 1 user, load averages: 2.07, 1.19, 1.05 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.

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