Euler totient in mathematical algorithms

Repository metrics

Stars

13,462 stars (13,462 stars)

PR merge metrics

No merged PRs in 30d (No merged PRs in 30d)

Description

Contributor guide

Research direction

Implement the Euler totient function φ(n) = n * ∏(1 1/p) for distinct prime divisors p. Optimize using prime factorization. Write tests to verify results for n from 1 to 1000.

Tech stack

None

Domain

backend

Issue type

Feature

DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.

2

Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.

1-3 hours

Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.

Active

ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.

Clear

Prerequisites

C++Git

Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.

80