{"uid":"cap_nBcG3B4fHOW9dJma5Wj3Q","slug":"kihustle-permutation-counter-2cce6f9d","name":"KiHustle Permutation Counter","description":"Kostenlose Guides, Solo-Playbooks und Artikel zu KI, Automation und Side Hustles — für Menschen, die mit echten Systemen online Einkommen aufbauen wollen. Transparent finanziert über faire Affiliate-Links.","url":"https://kihustle.tech/agents/api/v1/permutation-counter","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"n":{"type":"integer"},"r":{"type":"integer"}}},"responseSchema":{"type":"json","example":{"result":"processed","status":"success"}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.002","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.002/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_r74Grf7fSEWMSOTm5z-9I","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.002","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes the number of r-permutations of n elements (nPr), returning the permutation count for given n and r integers","exampleAgentPrompt":"How many ordered arrangements can I make if I have 10 items and I want to pick 3 of them in order? Use the permutation counter with n=10 and r=3.","exampleUseCases":[{"title":"Lottery odds ordered selection","prompt":"I need to know how many possible ordered outcomes exist in a lottery where 6 numbers are drawn from a pool of 49 — can you calculate the permutation for n=49 and r=6?"},{"title":"Password combination counting","prompt":"If a PIN code uses 4 digits chosen from 0 to 9 with no repeats in a specific order, how many possible PINs are there? Compute the permutation for n=10 and r=4."},{"title":"Race finishing order possibilities","prompt":"There are 8 runners in a race and I want to know how many different ways the top 3 finishing positions could be filled — please calculate the permutation for n=8 and r=3."}],"resultDescription":"Returns a JSON object with a 'result' field containing the computed permutation count (nPr = n! / (n-r)!) and a 'status' field indicating success. The result reflects the number of ordered arrangements of r elements chosen from a set of n elements.","failureModes":["Invalid input: r > n (cannot choose more items than available)","Non-integer or negative values for n or r causing computation errors","Missing required fields (n or r) resulting in a bad request","Overflow errors for very large n values exceeding integer limits","Network or payment authorization failures returning HTTP 402"],"whenToPreferThis":"Choose this endpoint when you need a quick, programmatic computation of ordered permutations (nPr) without implementing the factorial math yourself. It is ideal for agents that need combinatorics calculations on-the-fly within workflows, particularly when the cost of a microservice call ($0.002 USDC) is acceptable. Prefer native math libraries for high-volume or very large integer scenarios where overflow may be a concern.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-13T19:02:59.823Z","isFirstParty":false}