CHARLY EDUARDO SUAREZ CUEVAS

GRUPO : 17
PORCENTAJE TERMINADO : 70 %

public static void main(String[] args) {

// TODO code application logic here
System.out.println(secASC(1,2));
}
public static boolean secASC (int a , int b)
{

return a <= b ;
}
}
public static boolean secASC (int a , int b , int c )
{

return a <= b && b <= c ;

}
}
public static boolean secASC (int a , int b , int c , int d )
{

return a <= b && b <= c && c <= d ;

}
}
public static boolean secASC (int a , int b , int c , int d , int
e)
{

return a <= b && b <= c && c <= d && d <= e ;

}
}

public static boolean secDES (int a , int b )

{

return a >= b;
}
}
public static boolean secDES (int a , int b , int c)
{

return a >= b && b >= c;

}
}
public static boolean secDES (int a , int b , int c , int d)
{

return a >= b && b >= c && c >= d;

}
}
public static boolean secDES (int a , int b , int c , int d , int
e)
{

return a >= b && b >= c && c >= d && d >= e;

}
}
public static boolean existePar (int a , int b )
{
 return a % 2 == 0 || b % 2 == 0;
}
public static boolean existePar (int a , int b , int c )
{

return a % 2 == 0 || b % 2 == 0 || c % 2 == 0;
}
}
public static boolean existePar (int a , int b , int c , int d )
{

return a % 2 == 0 || b % 2 == 0 || c % 2 == 0 || d % 2 == 0;
}
}
public static boolean existePar (int a , int b , int c , int d ,
int e )
{

return a % 2 == 0 || b % 2 == 0 || c % 2 == 0 || d % 2 == 0
|| e % 2 == 0;
}
}
public static boolean existePar (int a , int b )
{

return a % 2 != 0 || b % 2 != 0;
}
public static boolean existePar (int a , int b , int c )
{

return a % 2 != 0 || b % 2 != 0 || c % 2 != 0;
}
}
CHARLY EDUARDO SUAREZ CUEVAS
GRUPO : 17
PORCENTAJE TERMINADO : 70 %
COMENTARIOS : Ejercicios muy cansadores con mucha lgica me costo
muchicimo hice lo que pude
public static boolean existePar (int a , int b , int c , int d
)
{

return a % 2 != 0 || b % 2 != 0 || c % 2 != 0 || d % 2 != 0;
}
public static boolean existePar (int a , int b , int c , int d ,
int e )
{

return a % 2 != 0 || b % 2 != 0 || c % 2 != 0 || d % 2 != 0
|| e % 2 != 0;
}
public static boolean todosPar (int a , int b )
{

return a % 2 == 0 && b % 2 == 0;
}
public static boolean todosPar (int a , int b , int c )
{

return a % 2 == 0 && b % 2 == 0 && c % 2 == 0;

}
public static boolean todosPar (int a , int b , int c , int d )
{
 return a % 2 == 0 && b % 2 == 0 && c % 2 == 0 && d % 2 == 0;
}
public static boolean todosPar (int a , int b , int c , int d ,
int e )
{

return a % 2 == 0 && b % 2 == 0 && c % 2 == 0 && d % 2 == 0

&& e % 2 == 0;
}
public static boolean todosIMPar (int a , int b )
{

return a % 2 != 0 && b % 2 != 0 ;
}
public static boolean todosIMPar (int a , int b , int c )
{

return a % 2 != 0 && b % 2 != 0 && c % 2 != 0;

}
public static boolean todosIMPar (int a , int b , int c , int d )
{

return a % 2 != 0 && b % 2 != 0 && c % 2 != 0 && d % 2 != 0;

}
public static boolean todosIMPar (int a , int b , int c , int d ,
int e )
{

return a % 2 != 0 && b % 2 != 0 && c % 2 != 0 && d % 2 != 0

&& e % 2 != 0;
}
public static boolean parIMPar (int a , int b )
 {
return existePar (a,b) && existeImpar (a,b) ;
}
public static boolean parIMPar (int a , int b , int c )
{

return existePar (a,b, c) && existeImpar (a,b, c) ;

}
public static boolean parIMPar (int a , int b , int c , int d )
{

return existePar (a,b, c,d) && existeImpar (a,b, c, d) ;

}
public static boolean parIMPar (int a , int b , int c , int d, int
e )
{

return existePar (a,b, c,d,e) && existeImpar (a,b, c, d,e) ;

}
public static boolean palindrome (int a , int b )
{

return a == b ;
}
}
public static boolean palindrome (int a , int b , int c )
{

return a != b && b != c && a ==c ;

}
}
public static boolean palindrome (int a , int b , int c , int d )
{

return a != b && b == c && c !=d && a == d ;

}
}public static boolean palindrome (int a , int b , int c , int e )
{

return (((a != b && b != c && c !=d && d != e && a == e &&

&& b == d) ||a == b && b == c && c ==d && d == e && a == e && &&
b == d) ||a == b && b != c && c !=d && d == e && a == e && && b
== d);
}
}