Truncated distribution - Revision history

en>Nihiltres: Fixed ISBN

2014-06-09T17:22:17Z

Fixed ISBN

← Older revision		Revision as of 19:22, 9 June 2014
Line 1:		Line 1:
	~~[[Image:Znam-2-3-11-23-31.svg\|thumb\|301px\|Graphical demonstration that 1 = 1/2 + 1/3 + 1/11 + 1/23 + 1/31 + 1/(2×3×11×23×31). Therefore the product, 47058, is primary pseudoperfect.]]~~		The writer is called Irwin Wunder but it's not the most masucline title out there. For a while I've been in South Dakota and my mothers and fathers reside close by. To collect coins is a factor that I'm completely addicted to. Managing individuals is his profession.<br><br>Also visit my web site; [http://citymama.com.ua/profile_info.php?ID=38588 at home std test]
	~~In [[mathematics]], and particularly in [[number theory]], a '''primary pseudoperfect number''' is a number ''N'' that satisfies the [[Egyptian fraction]] equation~~
	~~:<math>\sum_{p\|N}\frac1p + \frac1N = 1,</math>~~
	~~where the sum is over only the prime divisors of ''N''. Equivalently (as can be seen by multiplying this equation by ''N''),~~
	~~:<math>\sum_{p\|N}\frac{N}p + 1 = N.</math>~~
	~~Except for the exceptional primary pseudoperfect number 2, this expression gives a representation for ''N'' as a sum of a set of distinct divisors of ''N''; therefore each such number (except 2)~~ is ~~[[Semiperfect number\|pseudoperfect]].~~

	~~Primary pseudoperfect numbers were first investigated and named by Butske, Jaje, and Mayernik (2000). The first few primary pseudoperfect numbers are~~
	~~:[[2 (number)\|2]], [[6 (number)\|6]], [[42 (number)\|42]], 1806, 47058, 2214502422, 52495396602, ... {{OEIS\|id=A054377}}.~~
	~~The first four of these numbers are one less than the corresponding numbers in [[Sylvester's sequence]]~~ but ~~later numbers in Sylvester~~'s ~~sequence do~~ not ~~similarly correspond to primary pseudoperfect numbers. It is unknown whether~~ there ~~are infinitely many primary pseudoperfect numbers, or whether there are any odd primary pseudoperfect numbers~~.

	~~The prime factors of primary pseudoperfect numbers may provide solutions to [[Znám~~'~~s problem]]~~ in which all members of the solution set are prime. For instance, the factors of the primary pseudoperfect number 47058 are the solution set {2,3,11,23,31} to Znám's problem. However, the smaller primary pseudoperfect numbers 2, 6, 42, and 1806 do not correspond to solutions to Znám's problem in this way, as their sets of prime factors violate the requirement in Znám's problem that no number in the set can equal one plus the product of all the other numbers. Anne (1998) observes that there is exactly one solution set of this type that has ''k'' primes in it, for each ''k'' ≤ 8, and ~~conjectures that the same is true for larger ''k''~~.

	~~If a primary pseudoperfect number ''N''~~ is ~~one less than~~ a ~~prime number, then~~ '~~'N''×(''N''+1) is also primary pseudoperfect~~. ~~For instance, 47058 is primary pseudoperfect, and 47059 is prime, so 47058 × 47059 = 2214502422~~ is ~~also primary pseudoperfect.~~

	~~See also [[Giuga number]]~~.

	~~==References==~~
	* {{citation
	~~\| last = Anne \| first = Premchand~~
	~~\| title = Egyptian fractions and the inheritance problem~~
	~~\| journal = The College Mathematics Journal~~
	~~\| volume = 29~~
	~~\| issue = 4~~
	~~\| year = 1998~~
	~~\| pages = 296–300~~
	~~\| doi = 10.2307/2687685~~
	~~\| jstor = 2687685~~
	~~\| publisher = The College Mathematics Journal, Vol. 29, No. 4}}.~~

	* {{citation
	~~\| last1 = Butske \| first1 = William \| last2 = Jaje \| first2 = Lynda M. \| last3 = Mayernik \| first3 = Daniel R.~~
	~~\| title = On the equation~~ <~~math~~>~~\scriptstyle\sum_{p\|N}\frac{1}{p}+\frac{1}{N}=1~~<~~/math~~>~~, pseudoperfect numbers, and perfectly weighted graphs~~
	~~\| journal =~~ [~~[Mathematics of Computation]]~~
	~~\| volume = 69~~
	~~\| year = 2000~~
	~~\| pages = 407–420~~
	~~\| doi = 10~~.~~1090~~/~~S0025-5718-99-01088-1}}~~.

	~~==External links==~~
	* {{PlanetMath \| urlname = PrimaryPseudoperfectNumber \| title = Primary Pseudoperfect Number}}
	* {{MathWorld \| urlname = PrimaryPseudoperfectNumber \| title = ~~Primary Pseudoperfect Number}}~~

	~~{{Classes of natural numbers}}~~

	~~[[Category:Integer sequences]]~~
	~~[[Category:Egyptian fractions]~~]

76.91.203.95 at 06:55, 19 March 2013

2013-03-19T06:55:53Z

← Older revision		Revision as of 08:55, 19 March 2013
Line 1:		Line 1:
	~~Nice to satisfy you, I am Marvella Shryock. My working day over the~~ [~~http~~://~~hivtest~~.~~Cdc~~.~~gov/ counter std~~] ~~test occupation~~ is a ~~meter reader~~. ~~Puerto Rico is where he~~'~~s been residing~~ for ~~years~~ and ~~he will never move~~. ~~One~~ of the ~~extremely std testing at~~ [~~http://www~~.~~zavodpm~~.~~ru/blogs/ashelykeplerlkws/9653-valuable-guidance-successfully-treating-candida-albicans home std test kit~~] ~~best things~~ in the ~~world at home [http://raybana~~.~~com/chat/pg/profile/GIsaachse std home test] test for me is~~ to do ~~aerobics and I~~'~~ve been performing~~ it for ~~fairly~~ a ~~whilst~~.<br><br>~~Also visit my~~ [~~http://Chastity~~.~~com/chastity-qa/stds/infections~~/~~whats~~-~~most~~-~~common~~-~~std/whats~~-~~most web blog] ..~~. [~~https~~:~~//healthcoachmarketing.zendesk.com/entries/53672184-Candida-Tips-And-Cures-That-May-Meet-Your-Needs https~~:~~//healthcoachmarketing.zendesk.com/entries/53672184-Candida-Tips-And-Cures-That-May-Meet-Your-Needs~~]		[[Image:Znam-2-3-11-23-31.svg\|thumb\|301px\|Graphical demonstration that 1 = 1/2 + 1/3 + 1/11 + 1/23 + 1/31 + 1/(2×3×11×23×31). Therefore the product, 47058, is primary pseudoperfect.]]
			In [[mathematics]], and particularly in [[number theory]], a '''primary pseudoperfect number''' is a number ''N'' that satisfies the [[Egyptian fraction]] equation
			:<math>\sum_{p\|N}\frac1p + \frac1N = 1,</math>
			where the sum is over only the prime divisors of ''N''. Equivalently (as can be seen by multiplying this equation by ''N''),
			:<math>\sum_{p\|N}\frac{N}p + 1 = N.</math>
			Except for the exceptional primary pseudoperfect number 2, this expression gives a representation for ''N'' as a sum of a set of distinct divisors of ''N''; therefore each such number (except 2) is [[Semiperfect number\|pseudoperfect]].

			Primary pseudoperfect numbers were first investigated and named by Butske, Jaje, and Mayernik (2000). The first few primary pseudoperfect numbers are
			:[[2 (number)\|2]], [[6 (number)\|6]], [[42 (number)\|42]], 1806, 47058, 2214502422, 52495396602, ... {{OEIS\|id=A054377}}.
			The first four of these numbers are one less than the corresponding numbers in [[Sylvester's sequence]] but later numbers in Sylvester's sequence do not similarly correspond to primary pseudoperfect numbers. It is unknown whether there are infinitely many primary pseudoperfect numbers, or whether there are any odd primary pseudoperfect numbers.

			The prime factors of primary pseudoperfect numbers may provide solutions to [[Znám's problem]] in which all members of the solution set are prime. For instance, the factors of the primary pseudoperfect number 47058 are the solution set {2,3,11,23,31} to Znám's problem. However, the smaller primary pseudoperfect numbers 2, 6, 42, and 1806 do not correspond to solutions to Znám's problem in this way, as their sets of prime factors violate the requirement in Znám's problem that no number in the set can equal one plus the product of all the other numbers. Anne (1998) observes that there is exactly one solution set of this type that has ''k'' primes in it, for each ''k'' ≤ 8, and conjectures that the same is true for larger ''k''.

			If a primary pseudoperfect number ''N'' is one less than a prime number, then ''N''×(''N''+1) is also primary pseudoperfect. For instance, 47058 is primary pseudoperfect, and 47059 is prime, so 47058 × 47059 = 2214502422 is also primary pseudoperfect.

			See also [[Giuga number]].

			==References==
			* {{citation
			\| last = Anne \| first = Premchand
			\| title = Egyptian fractions and the inheritance problem
			\| journal = The College Mathematics Journal
			\| volume = 29
			\| issue = 4
			\| year = 1998
			\| pages = 296–300
			\| doi = 10.2307/2687685
			\| jstor = 2687685
			\| publisher = The College Mathematics Journal, Vol. 29, No. 4}}.

			* {{citation
			\| last1 = Butske \| first1 = William \| last2 = Jaje \| first2 = Lynda M. \| last3 = Mayernik \| first3 = Daniel R.
			\| title = On the equation <math>\scriptstyle\sum_{p\|N}\frac{1}{p}+\frac{1}{N}=1</math>, pseudoperfect numbers, and perfectly weighted graphs
			\| journal = [[Mathematics of Computation]]
			\| volume = 69
			\| year = 2000
			\| pages = 407–420
			\| doi = 10.1090/S0025-5718-99-01088-1}}.

			==External links==
			* {{PlanetMath \| urlname = PrimaryPseudoperfectNumber \| title = Primary Pseudoperfect Number}}
			* {{MathWorld \| urlname = PrimaryPseudoperfectNumber \| title = Primary Pseudoperfect Number}}

			{{Classes of natural numbers}}

			[[Category:Integer sequences]]
			[[Category:Egyptian fractions]]

en>EmausBot: r2.7.2+) (Robot: Modifying fr:Loi tronquée

2012-05-16T01:37:55Z

r2.7.2+) (Robot: Modifying fr:Loi tronquée

New page

Nice to satisfy you, I am Marvella Shryock. My working day over the [http://hivtest.Cdc.gov/ counter std] test occupation is a meter reader. Puerto Rico is where he's been residing for years and he will never move. One of the extremely std testing at [http://www.zavodpm.ru/blogs/ashelykeplerlkws/9653-valuable-guidance-successfully-treating-candida-albicans home std test kit] best things in the world at home [http://raybana.com/chat/pg/profile/GIsaachse std home test] test for me is to do aerobics and I've been performing it for fairly a whilst.<br><br>Also visit my [http://Chastity.com/chastity-qa/stds/infections/whats-most-common-std/whats-most web blog] ... [https://healthcoachmarketing.zendesk.com/entries/53672184-Candida-Tips-And-Cures-That-May-Meet-Your-Needs https://healthcoachmarketing.zendesk.com/entries/53672184-Candida-Tips-And-Cures-That-May-Meet-Your-Needs]

← Older revision		Revision as of 19:22, 9 June 2014
Line 1:		Line 1:
	~~[[Image:Znam-2-3-11-23-31.svg\|thumb\|301px\|Graphical demonstration that 1 = 1/2 + 1/3 + 1/11 + 1/23 + 1/31 + 1/(2×3×11×23×31). Therefore the product, 47058, is primary pseudoperfect.]]~~		The writer is called Irwin Wunder but it's not the most masucline title out there. For a while I've been in South Dakota and my mothers and fathers reside close by. To collect coins is a factor that I'm completely addicted to. Managing individuals is his profession.<br><br>Also visit my web site; [http://citymama.com.ua/profile_info.php?ID=38588 at home std test]
	~~In [[mathematics]], and particularly in [[number theory]], a '''primary pseudoperfect number''' is a number ''N'' that satisfies the [[Egyptian fraction]] equation~~
	~~:<math>\sum_{p\|N}\frac1p + \frac1N = 1,</math>~~
	~~where the sum is over only the prime divisors of ''N''. Equivalently (as can be seen by multiplying this equation by ''N''),~~
	~~:<math>\sum_{p\|N}\frac{N}p + 1 = N.</math>~~
	~~Except for the exceptional primary pseudoperfect number 2, this expression gives a representation for ''N'' as a sum of a set of distinct divisors of ''N''; therefore each such number (except 2)~~ is ~~[[Semiperfect number\|pseudoperfect]].~~

	~~Primary pseudoperfect numbers were first investigated and named by Butske, Jaje, and Mayernik (2000). The first few primary pseudoperfect numbers are~~
	~~:[[2 (number)\|2]], [[6 (number)\|6]], [[42 (number)\|42]], 1806, 47058, 2214502422, 52495396602, ... {{OEIS\|id=A054377}}.~~
	~~The first four of these numbers are one less than the corresponding numbers in [[Sylvester's sequence]]~~ but ~~later numbers in Sylvester~~'s ~~sequence do~~ not ~~similarly correspond to primary pseudoperfect numbers. It is unknown whether~~ there ~~are infinitely many primary pseudoperfect numbers, or whether there are any odd primary pseudoperfect numbers~~.

	~~The prime factors of primary pseudoperfect numbers may provide solutions to [[Znám~~'~~s problem]]~~ in which all members of the solution set are prime. For instance, the factors of the primary pseudoperfect number 47058 are the solution set {2,3,11,23,31} to Znám's problem. However, the smaller primary pseudoperfect numbers 2, 6, 42, and 1806 do not correspond to solutions to Znám's problem in this way, as their sets of prime factors violate the requirement in Znám's problem that no number in the set can equal one plus the product of all the other numbers. Anne (1998) observes that there is exactly one solution set of this type that has ''k'' primes in it, for each ''k'' ≤ 8, and ~~conjectures that the same is true for larger ''k''~~.

	~~If a primary pseudoperfect number ''N''~~ is ~~one less than~~ a ~~prime number, then~~ '~~'N''×(''N''+1) is also primary pseudoperfect~~. ~~For instance, 47058 is primary pseudoperfect, and 47059 is prime, so 47058 × 47059 = 2214502422~~ is ~~also primary pseudoperfect.~~

	~~See also [[Giuga number]]~~.

	~~==References==~~
	* {{citation
	~~\| last = Anne \| first = Premchand~~
	~~\| title = Egyptian fractions and the inheritance problem~~
	~~\| journal = The College Mathematics Journal~~
	~~\| volume = 29~~
	~~\| issue = 4~~
	~~\| year = 1998~~
	~~\| pages = 296–300~~
	~~\| doi = 10.2307/2687685~~
	~~\| jstor = 2687685~~
	~~\| publisher = The College Mathematics Journal, Vol. 29, No. 4}}.~~

	* {{citation
	~~\| last1 = Butske \| first1 = William \| last2 = Jaje \| first2 = Lynda M. \| last3 = Mayernik \| first3 = Daniel R.~~
	~~\| title = On the equation~~ <~~math~~>~~\scriptstyle\sum_{p\|N}\frac{1}{p}+\frac{1}{N}=1~~<~~/math~~>~~, pseudoperfect numbers, and perfectly weighted graphs~~
	~~\| journal =~~ [~~[Mathematics of Computation]]~~
	~~\| volume = 69~~
	~~\| year = 2000~~
	~~\| pages = 407–420~~
	~~\| doi = 10~~.~~1090~~/~~S0025-5718-99-01088-1}}~~.

	~~==External links==~~
	* {{PlanetMath \| urlname = PrimaryPseudoperfectNumber \| title = Primary Pseudoperfect Number}}
	* {{MathWorld \| urlname = PrimaryPseudoperfectNumber \| title = ~~Primary Pseudoperfect Number}}~~

	~~{{Classes of natural numbers}}~~

	~~[[Category:Integer sequences]]~~
	~~[[Category:Egyptian fractions]~~]