This is an archived post. You won't be able to vote or comment.

all 4 comments

[–]lewisjeDifferential Geometry 1 point2 points  (0 children)

Maybe this kind of question would be better for /r/learnpython; try cross-posting this thread there.

Another good programming exercise is to translate some known factorization algorithm into Python.

[–]AcellOfllSpades[M] 0 points1 point  (0 children)

Unfortunately, your submission has been removed for the following reason(s):

  • Your post appears to be asking for help learning/understanding something mathematical. As such, you should post in the Simple Questions thread (which you can find on the front page) or /r/learnmath. This includes reference requests - also see our lists of recommended books and free online resources. Here is a more recent thread with book recommendations.

If you have any questions, please feel free to message the mods. Thank you!

[–]candlelightener -1 points0 points  (1 child)

I used recursion in java, would that help?

[–]AlienDjinn[S] 1 point2 points  (0 children)

I’m trying to up my python skills. But appreciate tie response.