Help proving prime and permutation

In summary, to prove that a number is prime, methods such as the Sieve of Eratosthenes, the AKS primality test, or the Miller-Rabin primality test can be used. A permutation is a rearrangement of a set of elements and can refer to rearranging the digits of a number to create a new number. There is no guaranteed method for proving that a permutation of a prime number will also be prime, but patterns and properties can help in making educated guesses. There are many known examples of prime permutations, including 197 which has the prime permutations 971 and 719. Computer algorithms such as the brute force method or the Sieve of Eratosthenes can be used to find prime permutations
  • #1
zachthemath
1
0
https://imgur.com/a/9tDdMqt

Hey So I am trying to prove this.

I tried using linear combinations and not sure how that would help. I am just not familiar with combinatorics and wondering if anyone would enlighten me.
 
Physics news on Phys.org
  • #2
zachthemath said:
https://imgur.com/a/9tDdMqt

Hey So I am trying to prove this.

I tried using linear combinations and not sure how that would help. I am just not familiar with combinatorics and wondering if anyone would enlighten me.

Hi zachthemath, welcome to MHB!

Your picture link does not seem to work.
Can you fix it?
 

Similar threads

Replies
28
Views
3K
Replies
3
Views
1K
Replies
8
Views
1K
Replies
1
Views
4K
Replies
1
Views
989
Replies
23
Views
2K
Replies
6
Views
2K
Back
Top