Connection
Base URL, credentials and a reachable server.
Product
Product features · Euler totient counts
01
Track removed prime factors alongside the totient accumulator so the special input one and repeated factors remain visible during review.
Selection
A model available through the configured endpoint.
Capabilities
Context limits and tool support are determined by the model and server.
Euler totient counts
● ● ●TotientRill●
A concrete starting point · Euler totient counts ×
def totient(value):
if type(value) is not int or not 1 <= value <= 1000000000:
raise ValueError("value.range")
remaining, result, factor = value, value, 2
while factor * factor <= remaining:
if remaining % factor == 0:
result -= result // factor
while remaining % factor == 0:
remaining //= factor
factor += 1
if remaining > 1:
result -= result // remaining
return result✳Count integers from one through n that are coprime to n using Euler’s totient, with n capped at 1000000000.
✓ ChangesReview before applying ↗
Illustrative workspace