Skip to content

Merge implementation of Hardy_Ramanujan Algorithm in /maths #1356

Closed
#1355
Closed
Merge implementation of Hardy_Ramanujan Algorithm in /maths#1356
#1355

Description

@alfinwilliam
alfinwilliam
opened on Oct 13, 2019

It's a theorem that states the number of prime factors of n will approximately be log(log(n)) for most natural numbers n.#1355

Activity

  1. cclauss
    closed this as completedin #1355on Oct 19, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions