{"uid":"cap_IYZV-zCp-ZUVVJWfNSQUH","slug":"kihustle-permutation-counter-c9968c8d","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/bot-bazaar/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_lSVqr_VJpxkjcEg-uLz_b","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) given integers n and r","exampleAgentPrompt":"Calculate the number of permutations for choosing 3 items from a set of 10 — what is P(10, 3)?","exampleUseCases":[{"title":"Combinatorics homework helper","prompt":"I need to know how many ways I can arrange 4 books chosen from a shelf of 12 — can you compute P(12, 4) for me?"},{"title":"Password combination analysis","prompt":"If I have 26 characters and want to generate ordered codes of length 5, how many unique permutations are possible? Compute P(26, 5)."},{"title":"Race finishing order calculator","prompt":"There are 8 runners in a race and I only care about who finishes 1st, 2nd, and 3rd. How many different finishing orders are possible? That's P(8, 3)."}],"resultDescription":"Returns a JSON object with a 'result' field containing the computed permutation value and a 'status' field indicating success. Example: {\"result\": \"processed\", \"status\": \"success\"}.","failureModes":["Invalid or non-integer values for n or r return an error","r greater than n is mathematically undefined and may return an error or zero","Missing required fields n or r cause a bad request response","Very large values of n may cause overflow or timeout"],"whenToPreferThis":"Choose this endpoint when you need a quick, paid API call to compute permutations (nPr) without running local math. Useful in agent workflows where mathematical computation needs to be offloaded to an external service, or when building combinatorics tools on top of a pay-per-use micro-API infrastructure via x402.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T00:58:20.130Z","isFirstParty":false}