The numbers of non-primes in S

  • MHB
  • Thread starter Albert1
  • Start date
  • Tags
    Numbers
In summary, non-primes are positive integers that are not divisible by any other positive integer besides 1 and itself. To determine if a number is a non-prime, you can check if it is divisible by any number between 2 and the number itself. Primes are positive integers that are only divisible by 1 and itself, while non-primes are positive integers that are not divisible by any other number besides 1 and itself. To calculate the number of non-primes in a given set, you can first determine the total number of integers in the set and then subtract the number of primes. Studying the numbers of non-primes in a set can provide insights into the distribution and patterns of numbers, and can be used for
  • #1
Albert1
1,221
0
$S=({10^1+1,10^2+1,---------,10^{1000}+1})$

please prove the non-prime numbers in $S \geq 990$
 
Last edited:
Mathematics news on Phys.org
  • #2
hint :
determine the condition of n , where those numbers of $"10^n+1"$ are prime
and $1\leq n \leq 1000$
 
  • #3
Albert said:
hint :
determine the condition of n , where those numbers of $"10^n+1"$ are prime
and $1\leq n \leq 1000$

n cannot be odd > 1 becuase in that case $10^n = - 1$ mod 11 or $10^n+1$ mod 11 = 0

n cannot be a muliple of odd because if it is of odd p then $10^n+1$ is divisible by $10^p + 1$

so possible set of n is 1, and power of 2 that is $2 , 4,8,16, 32,64,128,256,512$ and not necessarily each of them is prime
so maximum prime numbers = 9 and minimum non prime is 991
 

FAQ: The numbers of non-primes in S

What is the definition of non-primes?

Non-primes are positive integers that are not divisible by any other positive integer besides 1 and itself.

How do you determine if a number is a non-prime?

To determine if a number is a non-prime, you can check if it is divisible by any number between 2 and the number itself. If it is not divisible by any of these numbers, then it is a non-prime.

What is the difference between primes and non-primes?

Primes are positive integers that are only divisible by 1 and itself, while non-primes are positive integers that are not divisible by any other number besides 1 and itself.

How do you calculate the number of non-primes in a given set?

To calculate the number of non-primes in a given set, you can first determine the total number of integers in the set and then subtract the number of primes. The remaining number will be the number of non-primes.

What is the significance of studying the numbers of non-primes in a set?

Studying the numbers of non-primes in a set can provide insights into the distribution and patterns of numbers. It can also be used for various applications such as cryptography and number theory.

Similar threads

Replies
5
Views
2K
Replies
7
Views
2K
Replies
24
Views
2K
Replies
4
Views
1K
Replies
3
Views
793
Replies
2
Views
1K
Back
Top