MONOMER ESLASTOMER

CH2 = CH – CH = CH2 CH2 – CH = CH – CH2n

Butadiena cauciucul butadienic (buna, SKB)
CH2 = C – CH = CH2  ( CH2 = C – CH = CH2 )n 

Cl Cl

cloropren Cauciuc cloroprenic (neopren, Nairit)

CH2 = CH – CH = CH2 (CH – CH2)x – (CH2 – CH = CH – CH2)y n
Butadiena C6H5
C6H5 – CH = CH2
Cauciuc butadienstirenic (Buna S, SKS, GRS, Crom 35)
Stiren
CH2 = CH – CH = CH2 CH3
Butadiena [ (C – CH2 -)x – (CH2 – CH = CH – CH2)y ] n
C6H5 – C = CH2
C6H5
CH3

 - metilstiren
cauciuc butadienic - metil stirenic (Buna S – S, Carom 1500)
CH2 = CH – CH = CH2 [– (CH – CH2)x – (CH2–CH = CH – CH2)y –]n
Butadiena
CH2 = CH – C≡N C≡N

Acrilonitril Cauiciuc butadien-acilonitrilic (Buna N, GRN)

CH3 CH3

CH2 = C – CH = CH2 (–CH2 – C = CH – CH2–)n

izopren cauciuc poliizoprenic

int a_prim(int n) { int aprim = 0; int d = 2, k, a, b; while(!aprim && d*d<n) { if(n % d == 0) { a = d; b = n
/ d; int prim = 1; if(a < 2) prim = 0; if(a > 2 && a % 2 == 0) prim = 0; for(k = 3; k * k <= a ; k = k + 2) if(a
% k == 0) prim = 0; if(prim) { if(b < 2) prim = 0; if(b > 2 && b % 2 == 0) prim = 0; for(k = 3; k * k <= b ; k
+= 2) if(b % k == 0) prim = 0; if(prim) aprim = 1; } } if(d==2) d++; else d = d + 2; } return aprim; }

Citește mai multe pe Brainly.ro - https://brainly.ro/tema/2937358#readmore

void perfect(int a, int b)

int np=0, num, j;

if (a%2==1) ++a;

if (b%2==1) --b;

for (num=b; num>=a; num-=2) {

int suma=0;

for (j=1; j<=num/2; ++j)

if (num%j==0) suma+=j;

if (suma==num) { ++np; cout << num << " " ;}

if (np==0) cout << "nu exista" << "\n";

return;

#include <iostream>
#define INF 2147000000
using namespace std;
int d, a, b, nrdivmax=-INF, maxx ,minn, nr, nrd, n, d2, m;
int main()
{
cin >> a >> b;
if(a%2==1)
a++;
for(n=a; n<=b; n=n+2)
{
nrd = 0;
d2 = 0;
m = n;
while(m%2 == 0)
m = m / 2, d2++;
for(d=1 ; d*d<m ; d = d + 2)
if(n % d == 0)
nrd = nrd + 2;
if(d * d == n)
nrd ++;
nrd = nrd * d2;

if(nrd>nrdivmax)
nrdivmax = nrd, minn = maxx = n;
else if(nrd == nrdivmax)
maxx = n;
}
cout << nrdivmax << " " << minn << " " << maxx;
return 0;
}