Skip to content
BenHudelson.com
  • Home
  • About
  • Contact

Prime Numbers

Finding Divisors And Prime Factors

February 12, 2016

Finding Divisors A divisor (D) of a number (N) is an integer that divides another integer with no remainder. In other words N mod D = 0. Sometimes, we are interested in finding all divisors of a number. If we are considering a programming solution to this problem, chances are we are dealing with very…

Continue

Prime Number Testing

February 12, 2016

A prime number (or a prime) is defined as a positive integer greater than 1 that has no positive divisors other than 1 and itself. If I wanted a programmatic test that a number is prime, my first instinct in C# would look something like this: static bool IsPrime(int number) { for(int i = 2;…

Continue

Search for:

Recent Posts

  • Fair Sharing: a Proposed Generalization of the Thue-Morse Sequence
  • Meditation: the Brain’s API for Intuition
  • Field Guide for the Bored Programmer Part 1: The Dos
  • Addition of Very Large Numbers
  • Combining For-Loops: Simplifying Finite Recursion

Recent Comments

  • Thilak on Addition of Very Large Numbers
  • nikhil verma on Addition of Very Large Numbers
  • benhudelson on Addition of Very Large Numbers
  • nikhil verma on Addition of Very Large Numbers
  • Joshua Drake on Field Guide for the Bored Programmer Part 1: The Dos

Archives

  • July 2016
  • June 2016
  • May 2016
  • April 2016
  • February 2016

Categories

  • C#
  • Calculator
  • Career
  • Combinatorics
  • Math
  • Meditation
  • Prime Numbers
  • Programming
  • Soft Skills
  • Uncategorized
  • Very Large Numbers

Meta

  • Log in
  • Entries RSS
  • Comments RSS
  • WordPress.org
Copyright © 2023 Your Name. All rights reserved.