Mid Square Method | Random Number Generation | Solved Example
In this video, you’ll learn how to generate pseudo-random numbers using the Mid-Square Method — one of the earliest and simplest algorithms in computational history.
We’ll walk through how the method works step-by-step, using a 4-digit seed, squaring it, extracting the middle digits, and converting the result into a number between 0 and 1. You’ll see exactly how the sequence unfolds, and then try completing it yourself as a hands-on exercise.
The tutorial also highlights the historical context, key limitations of the method, and why it’s no longer used in modern systems — making it a great learning tool for understanding the roots of randomness in computing.
By the end, you’ll have a solid grasp of how early computers generated random numbers and the insights it offers into algorithmic thinking.
If you are facing any issues do let me know in the comment section below, I am here to help ❤️
If you found this video useful then please consider subscribing to my channel 🙏
Chapters in the video:
0:00 Introduction
0:33 Problem Statement
01:04 What is Mid Square Method
02:00 Define the process
03:20 Step By Step Example
05:13 Limitations of Mide Square Method
06:48 Conclusion
Background Music Credits (in order of use)
Outro Music Credit:
Spirit by Sappheiros:
"Spirit by Sappheiros" is under a Creative Commons ( cc-by ) license
Music promoted by BreakingCopyright: https://bit.ly/sappheiros-spirit
On this page of the site you can watch the video online Mid Square Method | Random Number Generation | Solved Example with a duration of hours minute second in good quality, which was uploaded by the user Sigma Solver 19 July 2025, share the link with friends and acquaintances, this video has already been watched 1,046 times on youtube and it was liked by 21 viewers. Enjoy your viewing!
