#include <cstdio>
// exercice 10
int plus_petit_entier(int M) {
int n = 1;
int Somme = 0;
while (Somme < M)
{
Somme = Somme + n*n*n*n;
n = n+1;
}
return n-1;
}
// exercice 13 1.
int prochain_syracuse(int a)
{
int Un = a;
if (Un % 2 == 0)
{
Un = Un/2;
}
else
{
Un = 3*Un+1;
}
return Un;
}
// exercice 13 .2
int terme_syracuse(int x, int n)
{
int Un = x;
int nb = 0;
while (nb != n)
{
if (Un % 2 == 0)
{
Un = Un /2;
}
else
{
Un = 3*Un+1;
}
nb = nb + 1;
}
return Un;
}
// exercice 13 .3
int duree_vol(int x)
{
int Un = 0;
int max = terme_syracuse(x, Un);
while (max != 1)
{
Un = Un + 1;
max = terme_syracuse(x, Un);
}
return Un;
}
// exercice 13 .4
int plus_long_vol(int n)
{
int max = 0;
int duree = 0;
for (int i = 1; i<n; i = i+1)
{
duree = duree_vol(i);
if (duree > max)
{
max = duree;
}
}
return max;
}
// exercice 14 .1
int racine_entiere(int a)
{
int r = 0;
while ((r+1)*(r+1)<= a)
{
r = r+1;
}
return r;
}
// exercice 14 .2
void divise(int a, int b)
{
if (b%a == 0)
{
printf("%d divise %d\n", a, b);
}
else
{
printf("%d ne divise pas %d\n", a, b);
}
}
// exercice 14 .3
void est_premier(int a)
{
int terme = 1;
int conteur = 0;
while (terme < a-1)
{
if (a % terme == 0)
{
terme = a;
conteur = conteur + 1;
}
else
{
terme = terme + 1;
}
}
if (conteur > 0)
{
printf("%d n'est pas premier\n", a);
}
else
{
printf("%d est premier\n", a);
}
}
// exercice 14 .4
int main() {
int nb_n = 0;
int suite = 0;
nb_n = plus_petit_entier(20);
suite = terme_syracuse(9, 30);
int plus_long = plus_long_vol(10);
int temps = duree_vol(5);
int racine_entier = racine_entiere(36);
divise(5, 10);
est_premier(10);
printf("%d\n", nb_n);
printf("%d\n", suite);
printf("%d\n", temps);
printf("%d\n", plus_long);
printf("%d\n", racine_entier);
return nb_n;
}
To embed this project on your website, copy the following code and paste it into your website's HTML: