RE: Introduction to Prime Numbers, and finding the Largest Prime Factor of a number using Python

You are viewing a single comment's thread from:

Introduction to Prime Numbers, and finding the Largest Prime Factor of a number using Python

in programming •  8 years ago  (edited)

Good question ken! So far as I can tell, a Sierpinski triangle can be created by blacking out all of the even numbers in Pascal's triangle.

Ton's of patterns can be found in Pascal's triangle, not only primes, but Fibonacci numbers, square numbers and more. For example, look at all of the rows that have a prime number as their 2nd element. All of the other numbers in that row are divisible by that prime!
There's a lot of interconnectedness in mathematics, and all things.

programming
8 years ago by

Downvoting a post can decrease pending rewards and make it less visible. Common reasons:

  • Disagreement on rewards
  • Fraud or plagiarism
  • Hate speech or trolling
  • Miscategorized content or spam

Submit
$0.00
    0
    Authors get paid when people like you upvote their post.
    If you enjoyed what you read here, create your account today and start earning FREE STEEM!