Abrar Eyasireyasir2047.hashnode.dev·Jul 2, 2024Number of Divisors Using Prime FactorizationQuestion: Given a positive integer n, we must find the total number of divisors for n. Let d( n ) be the number of divisors for the natural number, n. We begin by writing the number as a product of prime factors: n = p^a* q^b* r ^c … then the number ...Discuss·1 likedivisors
Mann Jaintechmadeeasy.hashnode.dev·Jun 17, 2024Fermat Theorem: Number TheoryAny number which is a perfect square gives remainder either 0 or 1, when divided by 4. Even numbers would give 0 remainder and odd would give remainder as 1. Proof: Even number can be represented as : 2*n. Square of even number = (2n)^2 = 4n...Discussfermat
Quantum Cyber Solutionsqcs.hashnode.dev·May 12, 2024The Quantum Leap: Revolutionizing Number Theory and CryptographyPublished on Sunday, May 12, 2024 The Quantum Leap: Revolutionizing Number Theory and Cryptography ==================================================================== Authors Name Elon Tusk 😄 Twitter The Quantum Leap: Revolutionizing Number The...DiscussCryptography
Quantum Cyber Solutionsqcs.hashnode.dev·May 12, 2024The Quantum Leap: Revolutionizing Number Theory and CryptographyPublished on Sunday, May 12, 2024 The Quantum Leap: Revolutionizing Number Theory and Cryptography ==================================================================== Authors Name Elon Tusk 😄 Twitter The Quantum Leap: Revolutionizing Number The...DiscussCryptography
Samuel Nwankwosaminwankwo.hashnode.dev·Apr 26, 2023Math for Code: Essential Mathematical Concepts Every Programmer Should KnowListen up, all you aspiring developers out there! It's time to put down the calculators and pick up those textbooks because we're talking about Maths for Code. Yes, you heard me right - Maths. I know, I know, you thought being a developer meant you c...Discuss·26 readsProgramming basics
Aman NadafforTeckbaker's Blogteckbakers.hashnode.dev·Feb 6, 2023Number TheoryHui!! Euclid's Algo Let's start with GCD(Greatest Common Divisor). I would assume you know what GCD is. You might know different ways to calculate GCD. You might use Euclid's Algo to find the GCD of two numbers or you would just represent both number...Discuss·2 likes·77 readsDSANumber theory
Rajganesh Panduranganrajp.hashnode.dev·Jan 16, 2023Prime Numbers: What They Are and Why They MatterPrime numbers have captivated mathematicians for centuries. They’re so simple yet so important—they’re used in cryptography, coding, computer science, and much more. In this blog post, we’ll explore what prime numbers are, why they’re important, and ...Discuss·10 likes·134 readsNumber theory
Bonaventure OgetoforHojaLeaks Coding Tutorialshojaleaks.com·Nov 16, 2022What are Zero-Knowledge Proofs?A zero-knowledge proof is a way of proving the validity of a statement without revealing the statement itself. This is done by using a proof that allows you to prove something to someone else, without giving them any information about what you have e...Discuss·12 likes·65 readsBlockchainCryptography
NILOY DASforPsychedelic Treappsychedelic-treap.hashnode.dev·Oct 7, 2022Sieve of Eratosthenes in O(n)সিভ নিয়ে ফয়সালের এই লেখা পড়লে,কন্সেপ্ট বুঝতে সুবিধা হবে । কোনো সংখ্যাকে ১ এবং ঐ সংখ্যা ছাড়া আর কোনো সংখ্যা দ্বারা ভাগ করা না গেলে , সংখ্যাটা প্রাইম নাম্বার, আর যদি ভাগ যায় তাহলে সেটা কম্পজিট নাম্বার. একটা নাম্বার প্রাইম কিনা সেটা জানার জন্য প্রচলিত এ...Discuss·111 readsNumber TheoryC++
Naimul Haquenaimulhaque.com·Aug 30, 2019Sieve of Eratosthenes: Algorithm to Generate Prime NumbersIn the last article about prime numbers, I discussed about different types of primality test and Trial division method to verify if a number is a prime. If you haven’t read that yet, here is the article, Prime numbers and basic primality test. In thi...DiscussMathematics
