Efficient Primality Test in O(log n) Using a Simple Divisibility Rule πŸ”

Learn how to quickly determine if a number is prime by checking if 2^p - 2 is divisible by p. Watch the math video for a clear explanation and example!

Efficient Primality Test in O(log n) Using a Simple Divisibility Rule πŸ”
Try Coding
146 views β€’ Jan 23, 2021
Efficient Primality Test in O(log n) Using a Simple Divisibility Rule πŸ”

About this video

Basically if 2^p - 2 is divisible by p then p is a prime number
link to math video: https://www.youtube.com/watch?v=jbiaz_aHHUQ&t=139s

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

146

Likes

14

Duration

6:55

Published

Jan 23, 2021

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.