# we-solve referenced research prompt v2
{
  "schema": "we-solve.research-prompt-codec.v2",
  "instructions": "The template contains all rules and the output form. Join parts in order: strings are literal context; integers select template fragments. Then read the quoted source URL in that text. The copy button assembles the full prompt.",
  "template_url": "https://we-solve.github.io/prompts/templates/5035f52faf49f145e05ba8a2aa4eb22369997f2d88c875bc307955da41f0ffea.txt",
  "parts": [
    "",
    3,
    "https://we-solve.github.io/problems/what-is-n-1-n-2-n-where-n-is-the-euler-phi-totient-function-counting-the-number-of-integers-less-than-n/source/statement.tex\n# Statement token: [[WE_SOLVE_STATEMENT_f8a16e316568fbda166dd7a03524a1992ddc813239159ecb887275b07135ec03]]\n",
    2,
    "\n\n# we-solve research prompt: Math-5580, What is Σ_(n≥1 )φ(n)/2^(n), where φ(n) is the Euler phi (totient) function, counting the number of integers less than n\n\nWork on the problem below and prepare a contribution for we-solve (https://we-solve.github.io/problems/what-is-n-1-n-2-n-where-n-is-the-euler-phi-totient-function-counting-the-number-of-integers-less-than-n/).\n\n",
    0,
    "[[WE_SOLVE_STATEMENT_f8a16e316568fbda166dd7a03524a1992ddc813239159ecb887275b07135ec03]]\n>>>\n",
    5,
    "- None yet.\n",
    4,
    "prb_6a72ea5bbf964edcb0b9191dd2832d02",
    1,
    ""
  ]
}