{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $p$ be a prime number, and let $a$ and $b$ be nonzero integers.\nThen $\\nu_p(a b) = \\nu_p(a) + \\nu_p(b)$, where $\\nu_p$ is the [[p-adic valuation|04VCPS30ZE]].\n\n## Remarks\n\nWith the convention $\\nu_p(0) = \\infty$, the formula holds for all integers $a$ and $b$.\nThe proof uses [[Euclid's lemma|051VYKA1EX]]. Write $a = p^i a'$ and $b = p^j b'$ with $p \\nmid a'$ and $p \\nmid b'$. Then $p \\nmid a' b'$, so $\\nu_p(a b) = i + j$.\nFor example, $\\nu_2(12 \\cdot 10) = \\nu_2(120) = 3 = 2 + 1$.\n\n## Explanations\n\n### L1 human\n\nThe factors $p$ in $a b$ come from $a$ or from $b$, and no new factor $p$ appears.\nSo the number of factors $p$ in the product is the sum of the numbers of factors $p$ in $a$ and in $b$.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "kind": "statement",
    "msc": [
      "11A51"
    ],
    "name": "P-adic valuation of a product",
    "role": "proposition",
    "sources": [
      {
        "locator": "Definition and properties",
        "url": "https://en.wikipedia.org/wiki/P-adic_valuation"
      }
    ],
    "tag": "0850JJMJYZ",
    "uses": [
      "04VCPS30ZE"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/0850JJMJYZ/",
  "links": [
    {
      "field": "uses",
      "target": "04VCPS30ZE"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0850JJMJYZ.md",
  "msc": [
    "11A51"
  ],
  "name": "P-adic valuation of a product",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/085/0850JJMJYZ.md",
  "status": null,
  "tag": "0850JJMJYZ",
  "uri": "m2://0850JJMJYZ",
  "url": "https://math2.tamnd.com/wiki/p-adic-valuation-of-a-product/",
  "writing": {
    "tag": "0850JJMJYZ",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}
