Problem B. 4761. (January 2016)
B. 4761. Let \(\displaystyle n\) be an integer greater than 3. Prove that if each digit occurs exactly once in the base\(\displaystyle n\) representation of an integer then the number cannot be a prime.
Proposed by Z. Halasi, Csobánka
(4 pont)
Deadline expired on 10 February 2016.
Statistics:
123 students sent a solution.  
4 points:  79 students. 
3 points:  28 students. 
2 points:  11 students. 
1 point:  2 students. 
0 point:  2 students. 
Unfair, not evaluated:  1 solution. 
