Chat with our AI personalities
There are infinitely many options. For example, Un = (-n5 + 15n4 -85n3 + 230n2 - 279n + 140)/n The simplest, is Un = (n2 - n + 4)/2
It is easy to get a median with an odd amount of numbers, as there will always be one number in the middle of the list. So, for example, if you have 7 numbers, n1, n2, n3, n4, n5, n6, n7, the 4th number is always the median, so n4 would be the median value in this case.
#include<stdio.h> int main(){ int n1,n2; printf("\nEnter two numbers:"); scanf("%d %d",&n1,&n2); while(n1!=n2){ if(n1>=n2) n1=n1-n2; else n2=n2-n1; } printf("\nGCD=%d",n1); return 0; }
-5
The hybridization of N i n N2 is sp.