Seems that recently I have been tinkering a lot with various kinds of numbers and sequences of numbers. This entry doesn’t differ from previous ones in that respect, as I’m going to show two straightforward ways of computing prime numbers. 1,083 more words

## Tags » Sieve

#### pen, {de:constructed}

*you try to tell yourself the things you try to tell yourself
to make yourself forget…
– Counting Crows *

**
**i.

-sieve.

it’s a sieve. it leaves… 203 more words

#### UVa 10139 - Factovisors

Problem Link : https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1080

Solution Idea:

Calculate the prime factor of M. Let a prime is P and it’s power is x. so P^x is a prime factor of M. 645 more words

#### Comprehending Primes With Efficient Algorithms

What are primes?

A Number that has no divisors apart from one and itself is termed as prime.

The most naive algorithm for finding if a number is prime involves iterating i from 1 to n , checking if the number is divisible by i (using the modulus operator) . 1,283 more words