• We’re currently investigating an issue related to the forum theme and styling that is impacting page layout and visual formatting. The problem has been identified, and we are actively working on a resolution. There is no impact to user data or functionality, this is strictly a front-end display issue. We’ll post an update once the fix has been deployed. Thanks for your patience while we get this sorted.

PBS frontline Cyber War

D

damiano

Platinum Member
I recommend anyone whoworks in IT to see this program.,..
It was really good
+ I wish all my customers would see it so I can sell them contingency plans and security consulting 😉
 
I really wish the word 'cyber' would die out... it's such a lame term. I love Gibson's novels, but that word just sounds so lame. The Online War... or Digital War... Electronic War... are all better than Cyber War imo.

But anyways, thanks for the headsup. I'm going to see if i can find a copy of it anywhere.
 
Its impossible now Ive had time to think it out. The two conditions for a limit of infinity is that a. each iteration must be breater than the last, b. the DIFFERENCE must be monotonically non-decreasing.

Now, assume that a > 1. let n be the nth iteration. for n = 1, n > 1 obviously, so n^n > n.

for n = k, the kth iteration = n, the k+1th iteration = n^a, the difference = n^a-n.
for n = k+1, the k+1th iteration = n^a, the k+2th iteration = (n^a)^a, the difference = ((n^a)^a-n^a)

now, we must prove that ((n^a)^a-n^a) > n^a-n for all a > 1.

uh, my brain is too tired to proceed from here but thats essentially what you have to prove.

Anyway. QED proof ny mathematical Induction.
 
You must log in or register to reply here.

TRENDING THREADS

Back
Top