هوپا، انجمن علم ایران

اثباتش با حساب پیمانه ایه
و با توجه به اول بودن p و q اثبات می شه.

آره

فکر خوبیه

در ضمن در مطلبی که به عنوان مثلا اثبات گذاشتم باید دقت کنی ک اول بودن شرط اساسیه و همونی که فرمودی از طریق پیمانه واول بودن اثبات میشه


حالا سعی من بر اینه که ببینم ربطی به گلدباخ داره یا نه

شما گفتید که چون اون طرف زوجه و p هم فرده پس نسبت به هم اولند.ولی این همیشه درست نیست.مثل 5و100. 5 عددی اوله ولی نسبت به 100 اول نیست

به گلدباخ یکم ربط داره.درر واقع اگه گلد باخ درست باشه ما باید اون دو عدد اول رو از بین اعداد اولی پیدا کنیم که نسبت ب x اول باشن.

بله درسته شبیه این بود


ولی منظورم بصورت فشرده این بود که حاصل تفریق
این جوریه که چون از یه عدد اول یه عدد اول دیگه کم شه معلومه باقی مانده داره پس هیچ وقت بهش تقسیم پذیر نیست این که بدیهیه
و حاصل جمع هم که میشه با بحث زوج یا فرد حلش کرد


ببینید شما درست میگید که 5 و 10 مقسوم علیه مشترک دارن ولی دقت کنید منظور من این بود که هیچ وقت

عدد فرد بین 50 و 100 با خود 100 مقسوم علیه مشترک ندارد


مشتاق به تکرار اون چیزی که طرفین می دونن نیستم

خواهشا از ارتباط با گلدباخ حرف بزنید

اینجا نیستیم که یک حل پیمانه ای را بررسی کینم

یکم جلو رفتم ولی دیدم فاید نداره.
اگه گلد باخ درست باشه ما باید اون دو عدد اول رو از بین اعداد اولی پیدا کنیم که نسبت ب x اول باشن
در واقع اون دو تا عدد اول متعلقند به گروه یکال ها به پیمانه ی X.پس به جایی اینکه در مورد تمام اعداد اول کوچکتر از X صحبت کنیم بهتره بریم سراغ اعداد اول متعلق به گروه یکال های X.
حدود 4 ماه بهش فکر کردم ولی نتیجه نداد.
شاید هندسه جبری بتونه این مسئله رو راحت تر حل کنه

عذر میی خوام الان گرفتم که این اثبات های اضافی که دارم می کنم و ذهنم هزار جا رفت به خاطر اشتباه تایپی شماست

یه نگاهی به مثال اولتون بندازید

اونجا به جای 18
8 نوشتید

واسه همونه از ربطش آگاه نشدم آره درست میگید

او مای گاد.شرمنده انقدر خوابم میاد که دستام درست کار نمی کنن

هادی یکم واضح تر بگو منم متوجه شم! : (

اینی که گفتید درسته

الان غربال اراتوستن خیلی تغییر کرده یکی از مولفه هاش هم می تونه همین باشه

حتی در یک مورد خاص من غربال رو کار آمد تر کردم


آره با این کار غربال اراتوستن داره بهتر کار می کنه

اتفاقا غربال چی بود ؟؟؟؟؟؟؟؟؟/ یکی از کشفها که خیلی ضروریه و الان اسمش یادم نیست بهبود غرباله


احسان جان کجاشو میگی؟؟؟؟؟؟/

اینکه نسبت به x اول هستن

احسان اومدی اینجا ؟؟؟؟؟ مسنجرم خرابه پیام بده

[email protected]

http://arxiv.org/pdf/1305.2897v2.pdf
Last week Peruvian-born mathematician Harald Andrés Helfgott solved the odd Goldbach conjecture, an open problem that had been unresolved for 271 years.


The conjecture was formulated by Prussian mathematician Christian Goldbach in 1742. In its weak form, the conjecture states that every odd number greater than 5 can be expressed as the sum of three primes.


Helfgott, a researcher at the École Normale Supérieure in Paris, posted a 133-page mansucript on May 13, proving the weak Goldbach conjecture.


According to Truth Is Cool, although Helfgott’s paper has not yet been formally published or peer-reviewed, it has been endorsed by renowned mathematician Terrence Tao, who was close to resolving the problem last year.


“I think the important thing is — beyond where we live or work — to maintain a commitment to education and science in Peru and South America, and the particularly local math,” Helfgott wrote on his personal Facebook page.


“As several of my friends who work here, I regularly return to my place of origin to give workshops, conferences, and taking care of the students.”

He added, “I would like this so serve as appreciation for the work of many generations of Peruvian mathematicians.”

The odd Goldbach conjecture, a two-hundred and seventy-one year open problem of mathematics, has been resolved. Earlier today, H.A. Helfgott proved that any odd number greater than 5 can be written as the sum of 3 primes.

Number theory is the Queen of Mathematics, and the darling of number theory is the study of primes. A prime is a positive number that can only be divided by 1 and itself. A deceptively simple definition, but one that has captured the imagination of mathematicians since Euclid published his Elements around 300 BC. Through the years, thinkers have retreated to the sanctuary of prime numbers to stretch their minds and exercise their intellect in what was considered the most ivory tower of pursuits. The field was believed to be innocent of application, and free of the taint of industry and war. In 1940, struggling with the turmoil around him, the famous number-theorist G.H. Hardy wrote the historic words:

"I have never done anything 'useful'. No discovery of mine has made, or is likely to make, directly or indirectly, for good or ill, the least difference to the amenity of the world."

He was writing about his study of the primes. Little could he foresee that only 30 years later, the darling of mathematics would go on to form the key ingredient of the RSA algorithm for public key cryptography. Today, the difficulty of separating a number into the primes that multiply to form it secures all our private transactions on the internet.



Of course, multiplication is not the only way to split a number, our other choice is to use addition. In 1742, Prussian mathematician Christian Goldbach in a the margins of a letter of Leonhard Euler doodled a conjecture: every integer greater than 2 can be written as the sum of three primes. In the quarter-millennium since, the conjecture has been split into two parts, the strong and weak. The strong Goldbach conjecture states that every even number greater than 4 can be written as the sum of two primes, and the weak Goldbach conjecture states that every odd number greater than 5 can be written as the sum of three primes. The best mathematicians in the world have obsessed with both conjectures for centuries.

On Monday, May 13th, Harald Andrés Helfgott of the École Normale Supérieure – Paris posted a 133 page mansucript proving the weak Goldbach conjecture. His argument applies the circle method first developed by Hardy in 1917 (working with J.E. Littlewood and independently by I. M. Vinogradov). Mathematicians have been itching to close this chapter, and have inched towards a proof for years. Last year the result was close to resolve with Fields medalist (the mathematics equivalent of a Nobel Prize) Terence Tao showing that any odd integer is the sum of at most 5 primes. Now the conjecture is solved, and although it still has to go through the formalities of publication, Helfgott's preprint is endorsed and believed to be true by top mathematicians, Tao among them.