Pradeepsingh61/DSA_Code

[REQUEST] Add [Euler totient Function - Number Theory] in [CPP]

Open

#593 opened on Oct 9, 2025

View on GitHubContributor guide
 (0 comments) (1 reaction) (1 assignee)C++ (266 forks)auto 404
algorithmsenhancementhacktoberfestnew-language

Repository metrics

Stars
 (52 stars)
PR merge metrics
 (PR metrics pending)

Description

Algorithm Name

Euler totient Function

Programming Language

C++

Category

Mathematical Algorithms

Difficulty Level

Hard (Advanced)

Algorithm Description

ETF

References (Optional)

https://cp-algorithms.com/algebra/phi-function.html

Contribution Intent

  • I would like to implement this algorithm myself
  • I'm requesting this for someone else to implement
  • I need help implementing this algorithm

Code of Conduct

  • I agree to follow this project's Code of Conduct

Contributor guide

Research direction
Implement the Euler totient function in C++ using the CP Algorithms reference. The algorithm computes phi(n) for a given integer n, counting numbers less than n that are coprime to n. Study the formula using prime factorization and implement it efficiently with O(sqrt(n)) complexity.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
5
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
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++Number Theory
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
45