What is the logic behind the formula 2^n >= N where n is the number of borrowing bits and N the number of subnets? - Ekasquest

Raeed H 1 Jahr vor

What is the logic behind the formula 2^n >= N where n is the number of borrowing bits and N the number of subnets?

Bitte loggen Sie sich ein, um zu fragen, zu antworten, zu teilen, zu wählen und abzustimmen.