Maths behind every it operation. (development and management)
(Development and Management.)
Maths Behind Every IT Operations.
People usually thinks about Number and calculation but it is not completely true.
Mathematics is the abstract study of quantity, structure, space,
change, and many other topics. It has no generally accepted definition.
Today we will discuss about some famous algorithms used in IT industry.
Fun @ Math?Yes :) (This part is FYI for readers. Please read following documents if you are interested. I'm not going to
explain discuss this points)
Some interesting stories:
• Évariste Galois : http://en.wikipedia.org/wiki/%C3%89variste_Galois
Benefits OF CPM, PERT
Benefits of CPM/PERT :
• Useful at many stages of project management
• Mathematically simple
• Give critical path and slack time
• Provide project documentation
• Useful in monitoring costs
CPM/PERT can answer the following important questions:
How long will the entire project take to be completed? What are the risks involved?
Which are the critical activities or tasks in the project which could delay the entire
project if they were not completed on time?
Is the project on schedule, behind schedule or ahead of schedule?
If the project has to be finished earlier than planned, what is the best way to do this
at the least cost?
Situations in network diagram
A must finish before either B or C can start
C both A and B must finish before C can start
both A and C must finish before either of
B or D can start
A must finish before B can start
both A and C must finish before D can start
A. Toast Bread
B. Make an egg omelet
C. Spread butter on toast
D. Spread omelet on toast
3 minutes 2 minutes 1 minute
Sandwich PERT Chart
PERT : Problem Evolution and Review technique.
CPM : Critical Path Method.
g, 17 h, 9h,
How simple the algoritm is ?
• We all knows : we have some number say 'message'
• let multiply(encrypt) it by some number say 'a' .
• we got encrypted 'a*'message' .
• Now multiply it by inverse of 'a' i.e '1/a'
• we got our 'message' Back.
RSA Factoring Challenge: http://en.wikipedia.org/wiki/RSA_Factoring_Challenge
RSA is an algorithm for public-key cryptography that is based on the presumed difficulty of factoring large integers, the factoring problem. RSA
stands for Ron Rivest, Adi Shamir and Leonard Adleman, who first publicly described the algorithm in 1977. Clifford Cocks, an English
mathematician, had developed an equivalent system in 1973, but it wasn't declassified until 1997.
A user of RSA creates and then publishes the product of two large prime numbers, along with an auxiliary value, as their public key. The prime
factors must be kept secret. Anyone can use the public key to encrypt a message, but with currently published methods, if the public key is large
enough, only someone with knowledge of the prime factors can feasibly decode the message. Whether breaking RSA encryption is as hard as
factoring is an open question known as the RSA problem.
Java Code for RSA encryption and
Here is sample java code that you could use:
Fun @ Math?Yes :) (This part is FYI for readers and Please read following documents if you are interested. I'm not going to explain
discuss this points)
Theory behind Mathematical Singularity:- This function has singularity at x = 0. The actual world x ?
Read here. http://en.wikipedia.org/wiki/Gravitational_singularity