Cfrtjryk

#get user input for the number range

n = int(input("number"))

primes = 

#find all the prime numbers up to the specified value and append them to a list

for num in range(2, n+1):

  for i in range(2, num):

      if num % i == 0:

          break

  else:

     primes.append(num)



#find out if the prime number is a fare prime

for i in primes:

  length = len(str(i))

  #if the number has one digit it is automatically a fare prime

  if length == 1:

    print(i)

  #if the number is longer, rotate the digits to see if it is a fare prime

  if length >= 2:

    number = i

    fare_primes = 

    #rotate the number to figure out if all combinations are prime

    for j in range(length):

      #turns # into a list of digits

      digit_list = list(str(number))

      #rearranges

      number = [*digit_list[1::], digit_list[0]]

      part = ""

      #turns it back into an int value

      number = part.join(number)

      int_num = int(number)

      #check if # is prime

      for divider in range(2,int_num):

        if int_num % divider == 0:

          break

      else:

        fare_primes.append(number)

    #if all combinations of the digits are prime the original # is printed

    if len(fare_primes) == length:

      print(fare_primes[-1])

#get user input for the number range

n = int(input("number"))

primes = 

#find all the prime numbers up to the specified value and append them to a list

for num in range(2, n+1):

  for i in range(2, num):

      if num % i == 0:

          break

  else:

     primes.append(num)



#find out if the prime number is a fare prime

for i in primes:

  length = len(str(i))

  #if the number has one digit it is automatically a fare prime

  if length == 1:

    print(i)

  #if the number is longer, rotate the digits to see if it is a fare prime

  if length >= 2:

    number = i

    fare_primes = 

    #rotate the number to figure out if all combinations are prime

    for j in range(length):

      #turns # into a list of digits

      digit_list = list(str(number))

      #rearranges

      number = [*digit_list[1::], digit_list[0]]

      part = ""

      #turns it back into an int value

      number = part.join(number)

      int_num = int(number)

      #check if # is prime

      for divider in range(2,int_num):

        if int_num % divider == 0:

          break

      else:

        fare_primes.append(number)

    #if all combinations of the digits are prime the original # is printed

    if len(fare_primes) == length:

      print(fare_primes[-1])

#get user input for the number range

n = int(input("number"))

primes = 

#find all the prime numbers up to the specified value and append them to a list

for num in range(2, n+1):

  for i in range(2, num):

      if num % i == 0:

          break

  else:

     primes.append(num)



#find out if the prime number is a fare prime

for i in primes:

  length = len(str(i))

  #if the number has one digit it is automatically a fare prime

  if length == 1:

    print(i)

  #if the number is longer, rotate the digits to see if it is a fare prime

  if length >= 2:

    number = i

    fare_primes = 

    #rotate the number to figure out if all combinations are prime

    for j in range(length):

      #turns # into a list of digits

      digit_list = list(str(number))

      #rearranges

      number = [*digit_list[1::], digit_list[0]]

      part = ""

      #turns it back into an int value

      number = part.join(number)

      int_num = int(number)

      #check if # is prime

      for divider in range(2,int_num):

        if int_num % divider == 0:

          break

      else:

        fare_primes.append(number)

    #if all combinations of the digits are prime the original # is printed

    if len(fare_primes) == length:

      print(fare_primes[-1])

#get user input for the number range

n = int(input("number"))

primes = 

#find all the prime numbers up to the specified value and append them to a list

for num in range(2, n+1):

  for i in range(2, num):

      if num % i == 0:

          break

  else:

     primes.append(num)



#find out if the prime number is a fare prime

for i in primes:

  length = len(str(i))

  #if the number has one digit it is automatically a fare prime

  if length == 1:

    print(i)

  #if the number is longer, rotate the digits to see if it is a fare prime

  if length >= 2:

    number = i

    fare_primes = 

    #rotate the number to figure out if all combinations are prime

    for j in range(length):

      #turns # into a list of digits

      digit_list = list(str(number))

      #rearranges

      number = [*digit_list[1::], digit_list[0]]

      part = ""

      #turns it back into an int value

      number = part.join(number)

      int_num = int(number)

      #check if # is prime

      for divider in range(2,int_num):

        if int_num % divider == 0:

          break

      else:

        fare_primes.append(number)

    #if all combinations of the digits are prime the original # is printed

    if len(fare_primes) == length:

      print(fare_primes[-1])

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});