Tag Archives: Composite numbers

Primes in Arithmetic Progression

Posted on January 9, 2015 by Sumant Sumant

Now n terms of arithmetic progression looks like . What this tells us that a must be prime (because is the first term),also and must be relative primes otherwise will not be prime. Also if the beginning term is we … Continue reading →

Posted in Famous Problem, Number Theory, Prime Numbers, Relative Primes, Sequences | Tagged , , , | Leave a comment

Composite terms in arithmetic progression

Posted on January 8, 2015 by Sumant Sumant

Prove that there exists arbitrarily long arithmetic progressions whose terms are relatively prime in pairs and which consists entirely of composite numbers. Suppose we want to find n composite numbers which are pair wise prime. Recipe: Common difference is n! … Continue reading →

Posted in Number Theory, Prime Numbers, Proof by Contradiction, Sequences, Trick | Tagged , , , , | Leave a comment