formulasearchengine - User contributions [en]

British Association screw threads

2013-12-01T01:12:03Z

92.40.78.0:

In [[mathematics]], in the field of [[number theory]], the '''Ramanujan–Nagell equation''' is a particular [[exponential Diophantine equation]].

==Equation and solution==
The equation is
:<math>2^n-7=x^2 \,</math>
and solutions in natural numbers ''n'' and ''x'' exist just when ''n'' = 3, 4, 5, 7 and 15.

This was conjectured in 1913 by Indian mathematician [[Srinivasa Ramanujan]], proposed independently in 1943 by the Norwegian mathematician [[Wilhelm Ljunggren]], and [[mathematical proof|proved]] in 1948 by the Norwegian mathematician [[Trygve Nagell]]. The values on ''n'' correspond to the values of ''x'' as:-

:''x'' = 1, 3, 5, 11 and 181.<ref>Saradha & Srinivasan (2008) p.208</ref>

== Triangular Mersenne numbers ==
The problem of finding all numbers of the form 2''b'' − 1 ([[Mersenne number]]s) which are [[triangular number|triangular]] is equivalent:

:<math>2^b-1 = \frac{y(y+1)}{2}</math>
:<math>\Leftrightarrow 8(2^b-1) = 4y(y+1)</math>
:<math>\Leftrightarrow 2^{b+3}-8 = 4y^2+4y</math>
:<math>\Leftrightarrow 2^{b+3}-7 = 4y^2+4y+1</math>
:<math>\Leftrightarrow 2^{b+3}-7 = (2y+1)^2</math>

The values of ''b'' are just those of ''n'' − 3, and the corresponding triangular Mersenne numbers (also known as '''Ramanujan–Nagell numbers''') are:

:<math>\frac{y(y+1)}{2} = \frac{(x-1)(x+1)}{8}</math>

for ''x'' = 1, 3, 5, 11 and 181, giving 0, 1, 3, 15, 4095 and no more {{OEIS|id=A076046}}.

==Equations of Ramanujan–Nagell type==
An equation of the form

:<math> x^2 + D = A B^n </math>

for fixed ''D'', ''A'' , ''B'' and variable ''x'', ''n'' is said to be of ''Ramanujan–Nagell type''. A result of [[Carl Ludwig Siegel|Siegel]] implies that the number of solutions in each case is finite.<ref>Saradha & Srinivasan (2008) p.207</ref> The equation with ''A''=1, ''B''=2 has at most two solutions except in the case ''D''=7 already mentioned. There are infinitely many values of ''D'' for which there are two solutions, including <math>D = 2^m - 1</math>.<ref>Saradha & Srinivasan (2008) p.208</ref>

==Equations of Lebesgue–Nagell type==
An equation of the form

:<math> x^2 + D = A y^n </math>

for fixed ''D'', ''A'' and variable ''x'', ''y'', ''n'' is said to be of ''Lebesgue–Nagell type''. Results of Shorey and [[Robert Tijdeman|Tijdeman]] imply that the number of solutions in each case is finite.<ref>Saradha & Srinivasan (2008) p.211</ref>

==See also==
* [[Scientific equations named after people]]

==References==
{{reflist}}
* {{cite journal | author=S. Ramanujan | authorlink=Srinivasa Ramanujan | title=Question 464 | journal=J. Indian Math. Soc. | volume=5 | year=1913 | pages=130 }}
* {{cite journal | author=W. Ljunggren | authorlink=WIlhelm Ljunggren | title=Oppgave nr 2 | journal=Norsk Mat. Tidsskr. | volume=25 | year=1943 | pages=29 }}
* {{cite journal | author=T. Nagell | title=Løsning till oppgave nr 2 | journal=Norsk Mat. Tidsskr. | volume=30 | year=1948 | pages=62–64 }}
* {{cite journal | author=T. Nagell | title=The Diophantine equation ''x''2+7=2''n'' | journal=Ark. Mat. | volume=30 | year=1961 | pages=185–187 | doi=10.1007/BF02592006 }}
* {{cite book | last1=Shorey | first1=T.N. | last2=Tijdeman | first2=R. | author2-link=Robert Tijdeman | title=Exponential Diophantine equations | series=Cambridge Tracts in Mathematics | volume=87 | publisher=[[Cambridge University Press]] | year=1986 | isbn=0-521-26826-5 | zbl=0606.10011 | pages=137–138 }}
* {{cite book | editor-first=N. | editor-last=Saradha | title=Diophantine Equations | publisher=Narosa | year=2008 | isbn=978-81-7319-898-4 | first1=N. | last1=Saradha | first2=Anitha | last2=Srinivasan | chapter=Generalized Lebesgue–Ramanujan–Nagell equations | pages=207–223 }}

==External links==
* {{cite web | url=http://mathworld.wolfram.com/RamanujansSquareEquation.html | publisher=Wolfram MathWorld | title=Values of X corresponding to N in the Ramanujan–Nagell Equation | accessdate=2012-05-08 }}
* [http://mathforum.org/kb/message.jspa?messageID=419063&tstart=0 Can ''N''2 + ''N'' + 2 Be A Power Of 2?], Math Forum discussion

{{DEFAULTSORT:Ramanujan-Nagell equation}}
[[Category:Diophantine equations]]
[[Category:Srinivasa Ramanujan]]

Cross product

2012-08-26T22:51:12Z

92.40.13.98: Further magnitude notation corrections.

Lets stop right there. Im going to clear up a few things. All hyperlink exchanges are not dead. Link exchanges when implemented correctly can nevertheless be quite beneficial to your search engine rankings and can even drive traffic to your web site.... Ive study about hyperlink exchanges a lot recently. Ive seen a lot of individuals who say that their predictions that hyperlink exchanges would stop functioning saying that they have been right, and that they dont operate, and that they in truth hurt your website. Lets stop right there. Im going to clear up a few issues. All hyperlink exchanges are not dead. Hyperlink exchanges when implemented correctly can nonetheless be very helpful to your search engine rankings and can even drive visitors to your website. Prior to I tell you how to do it proper, let me inform you how to do it wrong. Any link exchanges promising hundreds or links immediately upon joining must be avoided unless the only search engine you care about is MSN (and even that may be ending soon). Exchanging hyperlinks with every internet site beneath the sun is also bad. Employing a hyperlink exchange as the only way you get links will also not be a path you want to wander down. Okay, so now that Ive taken all the enjoyable out of it, let me inform you how to do it so that you avoid any search engine penalties and in fact see your search engine rankings enhance from link exchanges. Initial, uncover service or software that will let you to manually seek and choose your partners. Second, as soon as youre in, take your time. A couple of hyperlinks here and a couple of there. Identify more about [http://www.top5seo.co.uk/dont-buy-link-emperor/ link emperor results] by browsing our fresh URL. Third, be consistent about it. Exchanging hyperlinks ought to be carried out every single week, or at the quite least every single month. You want the number of [http://Search.un.org/search?ie=utf8&site=un_org&output=xml_no_dtd&client=UN_Website_en&num=10&lr=lang_en&proxystylesheet=UN_Website_en&oe=utf8&q=hyperlinks&Submit=Go hyperlinks] to boost over time. [http://www.top5seo.co.uk/dont-buy-link-emperor/ Linkemperor] includes more about why to deal with this belief. Fourth, only trade links with internet sites that are related to yours. Should you wish to dig up new resources about [http://www.top5seo.co.uk/dont-buy-link-emperor/ link emperor review], we know of many databases people should consider pursuing. Also, make sure you check out the site youre linking to, you dont want to be linking to sites that are junk unless you want to be believed of as a junky internet site as well. Fifth, hold the quantity of hyperlinks to beneath 10% of the total number of hyperlinks pointing to your site. That indicates youre going to require other linking techniques, but thats okay, there are several accessible and you should be making use of them all. So now youre armed with the understanding of how to do link exchanges and remain in the great graces of the search engines. So the next time somebody begins proclaiming from their higher horse about how hyperlink exchanges got them banned or hurt their rankings, just preserve in mind that they had been probably attempting to use shortcuts to get artificially high search engines. There are in reality a lot of good motives for websites to be linked to 1 an additional, and the search engines know that. The thing the [http://Www.Dailymail.Co.uk/home/search.html?sel=site&searchPhrase=search+engines search engines] dont want to see is a site that will only link to a internet site that will link to it. Make sure you have one particular way links pointing both into and out of your website in addition to your hyperlink exchanges and youll be in great shape.. If you are you looking for more in regards to [http://dizzytailor139.snappages.com health insurance online] stop by our own site.

Talk:Supremum

2012-04-15T16:00:21Z

92.40.254.133: /* Questions for clarification */

Hello, I'm Dannielle, a 20 year old from Welden, Belgium. My hobbies include (but are not limited to) Bird watching, Petal collecting and pressing and watching Psych.