Tarea :

Funciones
Ciclos

Grupo N 12
Integrantes :
CHOQUE ORTEGA CARLA MARIEL
CHOQUE VERA JUAN JOSE
CHURA AQUINO MARIBEL
CONDORI ESCALERA YORDI
CORANI CALLE FRANCO GERARDO

Comentarios:

- Tuvimos dudas y complicaciones al elevar un nmero a una potencia ya que en

visual se puede usar directamente el signo de elevar mientras que en java se
tuvo que crear un funcin para ello.
- Nos fueron muy tiles las frmulas de sumatoria en cada enunciado ya que asi
pudimos guiarnos y aplicar ms rpido las formas de resolver.
Visual Basic
Function sumaEnteros(n As Integer) As Integer Dim
sum = 0
Dim i = 1
While (i <= n)
sum = sum + i
i = i + 1
End While
Return sum
End Function

Function sumaPares(n As Integer) As Integer Dim

sum = 0
Dim i = 1
While (i <= n)
sum = sum + 2 * i
i = i + 1
End While
Return sum
End Function

Function sumaImpares(n As Integer) As Integer

Dim sum = 0
Dim i = 1
While (i <= n)
sum = sum + (2 * i - 1)
i = i + 1
End While
Return sum
End Function

Function factorial(n As Integer) As Integer Dim

f = 1
Dim i = 1
While (i <= n)
f = f * i
i = i + 1
End While
Return f
End Function

Function Combinatoria(n As Integer, r As Integer) As Integer

Return factorial(n) / (factorial(r) * factorial(n - r))
End Function

Function sumCoef(n As Integer) As Integer Dim

sum = 0
Dim r = 0
While (r < n)
sum = sum + Combinatoria(n, r)
r = r + 1
End While
Return sum
End Function

Function Potencia(n As Integer, x As Integer) As Integer

Return x ^ n
End Function

Function sumPotencia(x As Integer, n As Integer) As Integer

Dim sum = 0
Dim i = 1
While (i <= n)
sum = sum + Potencia(i, x)
i = i + 1
End While
Return sum
End Function

Function Signo(n As Integer) As Integer

If (n Mod 2 = 0) Then Return +1 Else Return -1 End
Function

Function sumaInter(n As Integer) As Integer Dim

i = 1
Dim sum = 0
While (i <= n)
sum = sum + Signo(i) * i
i = i + 1
End While
Return sum
End Function

Function sumaCuadrados(n As Integer) As Integer Dim

sum = 0
Dim i = 1
While (i <= n)
sum = sum + (i * i)
i = i + 1
End While
Return sum
End Function

Delphi
Function sumaEnteros(n :Integer):Integer ;
var sum,i:Integer;
begin
sum:= 0;
i:= 1;
While (i <= n) Do
begin
sum:= sum + i;
i:= i + 1;
end;
Result:= sum;
end;

Function sumaPares(n:Integer): Integer;

var sum,i:Integer;
begin
sum:= 0;
i:= 1;
While (i <= n) Do
begin
sum:= sum + 2 * i;
i:= i + 1;
end;
Result:= sum;
end;
Function sumaImpares(n:Integer):Integer;
var sum,i:Integer;
begin
sum:= 0;
i:= 1;
While (i <= n) Do
begin
sum:= sum + (2 * i - 1);
i:= i + 1;
end;
Result:=sum;
end;
Function factorial(n:Integer):Integer;
var f,i:Integer;
begin
f:= 1;
i:= 1;
While (i <= n) Do
begin
f:= f * i;
i:= i + 1;
end;
Result:=f;
end;

Function Combinatoria(n,r:Integer): Real;

begin
Result:= factorial(n) / (factorial(r) * factorial(n - r)); end;

Function sumCoef(n:Integer): Real;

var sum:Real; r:Integer;
begin
sum:= 0;
r:= 0;
While (r < n) Do
begin
sum:= sum + Combinatoria(n, r);
r:= r + 1;
end;
Result:= sum;
end;

Function Potencia(n,x:Integer):Real;
begin
Result:= Exp( Ln(x) * n);
end;

Function sumPotencia(x,n:Integer): Real; var

sum:Real; i:Integer;
begin
sum:= 0;
i:= 1;
While (i <= n) Do
begin
sum:= sum + Potencia(i, x);
 i:= i + 1;
end;
Result:=sum;
end;

Function Signo(n:Integer):Integer;
begin
If (n Mod 2 = 0) Then Result:=+1 Else Result:= -1;
end;

Function sumaInter(n:Integer):Integer;
var i,sum:Integer;
begin
i:= 1;
sum:= 0;
While (i <= n) Do
begin
sum:= sum + Signo(i) * i;
i:= i + 1;
end;
Result:= sum;
end;

Function sumaCuadrados(n:Integer): Integer;

var sum,i:Integer;
begin
sum:= 0;
i:= 1;
While (i <= n) Do
begin
sum:= sum + (i * i);
i:= i + 1;
end;
Result:=sum;
end;

Java
package tarea.ciclos;
/**
*
* @author Dark_King
*/
import java.io.*;
import static javax.swing.JOptionPane.*;
public class TareaCiclos {

/**
* @param args the command line arguments
*/
public static void main(String[] args) {
int x=Integer.parseInt(showInputDialog("Ingrese el numero"));
String cad="";
for (int i= 0; i<x;i++)
{
cad = cad + 1 + "x" + (i+1)+"="+(1*(i+1))+"\n";
}
showMessageDialog(null,cad);
System.out.println(sumaenteros(4));
System.out.println(sumapares(2));

5
 System.out.println(sumaimpares(3));
System.out.println(factorial(3));
System.out.println(combinatoria(4,2));
System.out.println(sumacoeficientes(3));
System.out.println(potencia(6,2));
System.out.println(sumpot(6,2));

// TODO code application logic here

}
public static int sumaenteros(int n){
int i=1 , suma=0;
while (i<=n)
{
suma = suma + i;
i = i +1;
}
return suma;
}
public static int sumapares(int n){
int i=1 , suma=0;
while (i<=n)
{
suma = (suma +(2*i));
i = i+1;
}
return suma;
}
public static int sumaimpares(int n){
int i=1, suma =0;
while (i<=n)
{
suma = suma + (i*2)-1;
i= i+1;
}
return suma;
}
public static int factorial(int n){
int i= 1, f=1;
while (i<=n)
{
f = f *i;
i =i +1;
}
return f;
}
public static int combinatoria (int n, int r){
return factorial (n) / factorial(r)*(factorial(n-r));
}
public static int sumacoeficientes(int n ){
int r = 0, suma=0;
while (r < n)
{
suma = suma + combinatoria(n,r);
r = r+1;
}
return suma;
}
public static int potencia(int x, int n){
int p = 1, i=1;
while (i<=n)
{
p = p*x;
i=i+1;

6
 }
return p;
}
public static int sumpot(int x , int n){
int i=0, sum=0;
while(i <=n)
{
sum = sum + potencia (x,i);
i= i+1;
}
return sum;
}
public static int signo(int n){
if (n % 2 == 0)
return +1;
else return -1;
}
public static int sumainter(int n){
int i=1, suma=0;
while( i<=n)
{
suma = suma + signo(i)*i;
}
return suma;
}
public static int sumacuadrados(int n){
int i=1, suma=0;
while(i <= n)
{
suma = suma + (i * i);
i = i +1;
}
return suma;
}
}