Scribd Logo
Upload

Welcome to Scribd!

  • Polonomio Ruffini C++

    Uploaded by

    JoOze Chucüma
    38 views3 pages
    This C program finds integer roots of a polynomial P(x). It takes in coefficients of a polynomial entered by the user, prints the polynomial, then uses a nested for loop to check if P(x)=0 for integers from -10 to 10. If a root is found, it is printed. Finally, it reports whether any integer roots were found.

    Original Description:

    Polonomio Ruffini C++

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C program finds integer roots of a polynomial P(x). It takes in coefficients of a polynomial entered by the user, prints the polynomial, then uses a nested for loop to check if P(x)=0 for integers from -10 to 10. If a root is found, it is printed. Finally, it reports whether any integer roots were found.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    38 views3 pages

    Polonomio Ruffini C++

    Uploaded by

    JoOze Chucüma
    This C program finds integer roots of a polynomial P(x). It takes in coefficients of a polynomial entered by the user, prints the polynomial, then uses a nested for loop to check if P(x)=0 for integers from -10 to 10. If a root is found, it is printed. Finally, it reports whether any integer roots were found.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    #include<stdio.

    h>

    #include<stdlib.h>

    #include<conio.h>

    #include<math.h>

    int main()

    int B[20];

    int i,j,k,n,a,d;

    print("\t\tRAICES ENTERAS DE UN POLINOMIO P(x)\n\n");

    print("Ingrese coeficientes a0,a1,a2,a3,...,an del polinomio P(x) con un 1000 al final:\n");

    i=0;

    scanf("%d",&B[i]);

    while(B[i]!=1000)

    i=i+1;

    scanf("%d",&B[i]);

    print("\n");

    print("P(x): ");

    n=i;

    for(i=n-1;i>=0;i--)

    if(i==0)

    if(B[i]>=0)

    print("+%d",B[i]);

    else

    print("%d",B[i]);

    else
    {

    if(B[i]>=0&&i!=n-1)

    print("+%d",B[i]);

    print("x^%d",i);

    else

    print("%d",B[i]);

    print("x^%d",i);

    print("\n");

    d=0;

    a=0;

    for(k=-10;k<=10;k++)

    for(i=n-1;i>=0;i--)

    d=d+B[i]*(pow(k,i));

    if(d==0)

    print("\nLa raiz de P(x) es:%d",k);

    a=a+1;

    d=0;

    if(a==0)

    print("\nNo existen raices enteras del polinomio P(x)");


    print("\n");

    You might also like