mathworld.wolfram.com/PartitionFunctionP.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

12

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/PartitionFunctionP.html

Partition Function P -- from Wolfram MathWorld

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered significant. By convention, partitions are usually ordered from largest to smallest (Skiena 1990, p. 51). For example, since 4 can be written 4 = 4 (1) = 3+1 (2) = 2+2 (3) = 2+1+1 (4) =...



Bing

Partition Function P -- from Wolfram MathWorld

https://mathworld.wolfram.com/PartitionFunctionP.html

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered significant. By convention, partitions are usually ordered from largest to smallest (Skiena 1990, p. 51). For example, since 4 can be written 4 = 4 (1) = 3+1 (2) = 2+2 (3) = 2+1+1 (4) =...



DuckDuckGo

https://mathworld.wolfram.com/PartitionFunctionP.html

Partition Function P -- from Wolfram MathWorld

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered significant. By convention, partitions are usually ordered from largest to smallest (Skiena 1990, p. 51). For example, since 4 can be written 4 = 4 (1) = 3+1 (2) = 2+2 (3) = 2+1+1 (4) =...

  • General Meta Tags

    43
    • title
      Partition Function P -- from Wolfram MathWorld
    • DC.Title
      Partition Function P
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered significant. By convention, partitions are usually ordered from largest to smallest (Skiena 1990, p. 51). For example, since 4 can be written 4 = 4 (1) = 3+1 (2) = 2+2 (3) = 2+1+1 (4) =...
    • description
      P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered significant. By convention, partitions are usually ordered from largest to smallest (Skiena 1990, p. 51). For example, since 4 can be written 4 = 4 (1) = 3+1 (2) = 2+2 (3) = 2+1+1 (4) =...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_PartitionFunctionP.png
    • og:url
      https://mathworld.wolfram.com/PartitionFunctionP.html
    • og:type
      website
    • og:title
      Partition Function P -- from Wolfram MathWorld
    • og:description
      P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered significant. By convention, partitions are usually ordered from largest to smallest (Skiena 1990, p. 51). For example, since 4 can be written 4 = 4 (1) = 3+1 (2) = 2+2 (3) = 2+1+1 (4) =...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Partition Function P -- from Wolfram MathWorld
    • twitter:description
      P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered significant. By convention, partitions are usually ordered from largest to smallest (Skiena 1990, p. 51). For example, since 4 can be written 4 = 4 (1) = 3+1 (2) = 2+2 (3) = 2+1+1 (4) =...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_PartitionFunctionP.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/PartitionFunctionP.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

116