SOLUTION: I am trying to find the intersection of the sets of types of primes and so I am going up to 12 digit primes to be sure I find an intersection. I need the first 12 digit multiples o

Algebra.Com
Question 852671: I am trying to find the intersection of the sets of types of primes and so I am going up to 12 digit primes to be sure I find an intersection. I need the first 12 digit multiples of:
3, 4, 5, 6, and 7
Answer by Edwin McCravy(20065)   (Show Source): You can put this solution on YOUR website!
I'll just do the one for 7.  The others are done exactly
the same way:


To find the smallest 12 digit multiple of 7,
Let the number to multiply 7 by to get a 12-digit 
number be n.  Then

7n ≧ 100000000000

Divide both sides by 7

n ≧ 14285714285.714···

[if you need a calculator that shows that many digits,
there is one online here: http://web2.0calc.com/  ]  

The smallest integer n that fits that is

n = 14285714286

Answer: 7×14285714286 = 100000000002

Repeat the above procedures with 3,4,5, and 6 to get the others.

Edwin
RELATED QUESTIONS

Let P denote the product of all the positive primes less than 100. What is the units'... (answered by bucky)
Choose all the descriptions for natural numbers n that have 3 divisors. 1- n= p^2 * q... (answered by ikleyn,math_tutor2020)
Write the number as the sum of two primes there may be more than one way to do this... (answered by josgarithmetic)
I already graphed and shaded these two problems 9x+8y<72 and -7x-4y<_28 I am trying to... (answered by Alan3354)
The question asks: "The 2 digit number AB, with A not equal to 0, represents a prime if... (answered by richard1234)
Help with discrete mathematics! I cannot figure out these problems and I am struggling... (answered by ikleyn)
I am having a hard time even trying to set this problem up, I am sure once i see how to... (answered by jim_thompson5910)
. I need to proof that "There are infinitely many primes" (answered by tommyt3rd)
i am trying to find the gcf of x2y,... (answered by midwood_trail)