http://en.wikipedia...._root_algorithm

I do not remotely understand how to implement Newton's Method for finding Nth SQRT,

because I have a lack of understanding of it and I do not know how to turn a concept in C coding.

I am in serious need of help, PLEASE NOTE that the problem is that I do not know where to start and I am beginning C student in a class. (Which means I have a lack of knowledge for many functions of C except the ones that were given to me.)

#include <stdio.h> int main() { int n, CHECK; double A, root; printf("Enter real number and integer (A n): "); CHECK = scanf("%lf %d", &A, &n); if ( !(A >= 0) || !(n >= 2) || !(CHECK == 2)){ printf ("There is an error in your input for A or n \n"); } else { root =

That is how far I've gotten, I cannot go any further because I do NOT understand how the hell to translate Newton's Method to code. Theoretically I could do the work on paper but

THAT DOES NOT MEAN I UNDERSTAND WHAT MY MATH ON PAPER MEANS IN C CODE because I just don;t, there isn't a sort of book on how to do that either.