How can IPv6 calculate many subnets quickly?
Hello folks,
I'm writing an exam soon on IPv6 subnetting. I've understood the topic so far, but the problem is that the teacher requires us to calculate 8,000 or more subnets. But here's my problem:
The task will be as follows:
Opposite: Prefix FD00:1:1:C000::/51
Total: The 8000th network
Total:
1 network: ''
2 Network: ''
3 Network: ''
4 Network: ''
…
8000 network: ?
The teacher wants to see 4-6 nets first so the modulo can be recognized. Then, the student is asked to determine the last net. But what's the fastest way to do this?
I can't count to 8000 in binary. I'll still be working on that at Christmas.
Do you know a trick for solving this quickly? A non-programmable calculator is allowed in the exam, and my Texas Instruments TI-30 Mathprint can convert between bin/hex/ and decimal. Pretty handy 🙂
Thank you for your feedback
(1 votes)
Loading...
well binary 8000 is not that much
if you have 51 bits, pull the
51-13
so 128-51 + 13 => the host part, the 13 bits are your subnet parts
the first of which is 0 is the network ID, the last of which is the broadcast 11111
and each hex character is a 4 bit value, ergo quite easy to write.
FD00 0001 0001 000C 000::/51
now the 8000 come running once with 0s appended and once with 1s appended