Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement Math Algorithms #10

Open
4 of 15 tasks
manrajgrover opened this issue May 23, 2017 · 23 comments · May be fixed by #110
Open
4 of 15 tasks

Implement Math Algorithms #10

manrajgrover opened this issue May 23, 2017 · 23 comments · May be fixed by #110

Comments

@manrajgrover
Copy link
Owner

manrajgrover commented May 23, 2017

Math algorithms to be implemented are:

  • GCD
  • LCM
  • Multiplication Expo Squaring
  • Find Divisors
  • Fibonacci
  • Fisher Yates
  • Check if number is a prime
  • Calculate square root using Newton's method
  • Extended Euclid Algorithm
  • Mod Inverse
  • Mod Inverse using Fermet
  • Euler's Totient Function
  • Euler's Inverse method
  • Inverse of first 'n' numbers
  • Combination Modular
@3nr1c
Copy link

3nr1c commented Oct 25, 2017

Working on this one

@KalanaDananjaya
Copy link

is this issue still available? can i work on this?

@VictorKubrak
Copy link

@manrajgrover I would like to do Euler's Totient Function

@justinkook
Copy link

justinkook commented Oct 30, 2018

@manrajgrover I would like to work on the Fibonacci algorithm!

@yevseytsev
Copy link

I will do Find Divisors

@tallmanlaw
Copy link

I would like to work on check if the number is a prime. Thank you!

@alexbryant23
Copy link

I will do Fisher Yates!

@yevseytsev
Copy link

I will do Inverse of first 'n' numbers

@VictorKubrak
Copy link

I will do Mod Inverse, Mod Inverse using Fermet, and Fisher Yates

@yevseytsev
Copy link

I will implement Leonardo Numbers Sequence

@wciesialka wciesialka mentioned this issue Jan 20, 2019
3 tasks
@anamika2004
Copy link

I will work on the inverse of first n numbers and check if a number is prime.

@GnsP
Copy link

GnsP commented Oct 1, 2019

I will do the Combination Modular and Euler's Inverse.

@Harvey38
Copy link

Harvey38 commented Oct 5, 2019

I would like to do Fibonacci and check if prime

@SamuelGabani
Copy link

is this issue closed? or which functions are missing?

@kishore-srinivas
Copy link

i can do find divisors and square root by newton's method

@NavedInfy
Copy link

Is this still open. I would like to contribute if anything not done yet.

@arpit9667 arpit9667 linked a pull request Apr 4, 2020 that will close this issue
@rishavjnv12
Copy link

I want to contribute.

@arnabuchiha
Copy link

I also want to contribute.

@kishanbaranwal70
Copy link

Is there any issue which requires contribution?? I want to contribute.

@bhonsleaditya1
Copy link

I want to contribute. Is there anything I can work on ?

@Sar-thak-3
Copy link

If any of the above tasks are left to solve , kindle let me know!__

@ryguigas0
Copy link

ryguigas0 commented Oct 1, 2022

Hello, is any of the tasks available?

@DevasisPanda
Copy link

Hello ,
Is there any task available now??

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging a pull request may close this issue.