Question

If a number N is written in the form p1^a.p2^b.p3^c..pn^k, where a, b, c, , k are non negative integers and p1, p2, p3.pn are prime numbers, then the number N will have exactly (a+1)*(b+1)*(c+1)*..*(k+1) number of divisors.

no spam ❌. answer only who know co,ding ,​

Answer 1

Answer:

says that: if n is a positive integer and a, n are coprime, then aφ(n) ≡ 1 mod n where φ(n) is the Euler's totient function. Let's see some examples: 165 = 15*11, φ(165) = φ(15)*φ(11) = 80.

Answer 2

void factor(int n) {

int i;

for(i=2;i<=(int)sqrt(n);i++) {

while(n % i == 0) {

printf("%d “,i);

n /= i;

}

}

if (n > 1) printf(”%d",n);

printf("\n");

}

can u post any tough math question.