Remember that an integer n is prime if (i) n > 2 and (ii) it is only divisible by 1 and n itself. Subtask I: You will start by implementing a function is_prime(n: int) -> bool that returns True if the number n is prime and False otherwise. For example: • is_prime(1) should return False. • is_prime(2) should return True. • is_prime(-2) should return False. • is_prime(5) should return True. • is_prime(41) should return True. is_prime(323) should return False. Subtask II: The thing is, many people believe prime numbers bring sadness and must be avoided. To this end, you'll write a function sans_primes(numbers: list[int]) -> list[int] that takes in a list of integers and returns the numbers in the input list in the original order, except that every prime number is banned, so it will be excluded and numbers that come immediately after a prime number will also be excluded. For example: • sans_primes([1, 4, 9, 10]) should return [1, 4, 9, 10]. • sans_primes([1, 11, 9, 10, 17]) should return [1, 10]. • sans_primes([3, 10, 2, 8, 9, 4, 1, 7, 6, 5, 11]) should return [9, 4, 1]. sans_primes([3, 1, 2, 4]) should return []. • sans_primes([3, -2, 5, 7, 1, 42]) should return [42]. • sans_primes([1, 0, 3, 0, -2, 5, 7, 1, 42, 9]) should return [1, 0, -2, 42, 9].
Remember that an integer n is prime if (i) n > 2 and (ii) it is only divisible by 1 and n itself. Subtask I: You will start by implementing a function is_prime(n: int) -> bool that returns True if the number n is prime and False otherwise. For example: • is_prime(1) should return False. • is_prime(2) should return True. • is_prime(-2) should return False. • is_prime(5) should return True. • is_prime(41) should return True. is_prime(323) should return False. Subtask II: The thing is, many people believe prime numbers bring sadness and must be avoided. To this end, you'll write a function sans_primes(numbers: list[int]) -> list[int] that takes in a list of integers and returns the numbers in the input list in the original order, except that every prime number is banned, so it will be excluded and numbers that come immediately after a prime number will also be excluded. For example: • sans_primes([1, 4, 9, 10]) should return [1, 4, 9, 10]. • sans_primes([1, 11, 9, 10, 17]) should return [1, 10]. • sans_primes([3, 10, 2, 8, 9, 4, 1, 7, 6, 5, 11]) should return [9, 4, 1]. sans_primes([3, 1, 2, 4]) should return []. • sans_primes([3, -2, 5, 7, 1, 42]) should return [42]. • sans_primes([1, 0, 3, 0, -2, 5, 7, 1, 42, 9]) should return [1, 0, -2, 42, 9].
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Remember that an integer n is prime if (i) n> 2 and (ii) it is only divisible by 1 and n itself.
Subtask I: You will start by implementing a function is_prime(n: int) -> bool that returns True
if the number n is prime and False otherwise. For example:
• is_prime(1) should return False.
is_prime(2) should return True.
is_prime(-2) should return False.
is_prime(5) should return True.
• is_prime(41) should return True.
• is_prime(323) should return False.
Subtask II: The thing is, many people believe prime numbers bring sadness and must be avoided. To
this end, you'll write a function sans_primes(numbers: list[int]) -> list[int] that takes in a
list of integers and returns the numbers in the input list in the original order, except that every prime
number is banned, so it will be excluded and numbers that come immediately after a prime number
will also be excluded.
For example:
• sans_primes([1, 4, 9, 10]) should return [1, 4, 9, 10].
• sans_primes([1, 11, 9, 10, 17]) should return [1, 10].
• sans_primes([3, 10, 2, 8, 9, 4, 1, 7, 6, 5, 11]) should return [9, 4, 1].
• sans_primes([3, 1, 2, 4]) should return [].
• sans_primes([3, -2, 5, 7, 1, 42]) should return [42].
sans_primes([1, 0, 3, 0, -2, 5, 7, 1, 42, 9]) should return [1, 0, -2, 42, 9].](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6954e458-8753-495c-94b2-cdcc9bbfd17e%2Fae7b9b71-0b81-405e-b1a2-1e5a7c552e82%2Fkcypvlb_processed.png&w=3840&q=75)
Transcribed Image Text:Remember that an integer n is prime if (i) n> 2 and (ii) it is only divisible by 1 and n itself.
Subtask I: You will start by implementing a function is_prime(n: int) -> bool that returns True
if the number n is prime and False otherwise. For example:
• is_prime(1) should return False.
is_prime(2) should return True.
is_prime(-2) should return False.
is_prime(5) should return True.
• is_prime(41) should return True.
• is_prime(323) should return False.
Subtask II: The thing is, many people believe prime numbers bring sadness and must be avoided. To
this end, you'll write a function sans_primes(numbers: list[int]) -> list[int] that takes in a
list of integers and returns the numbers in the input list in the original order, except that every prime
number is banned, so it will be excluded and numbers that come immediately after a prime number
will also be excluded.
For example:
• sans_primes([1, 4, 9, 10]) should return [1, 4, 9, 10].
• sans_primes([1, 11, 9, 10, 17]) should return [1, 10].
• sans_primes([3, 10, 2, 8, 9, 4, 1, 7, 6, 5, 11]) should return [9, 4, 1].
• sans_primes([3, 1, 2, 4]) should return [].
• sans_primes([3, -2, 5, 7, 1, 42]) should return [42].
sans_primes([1, 0, 3, 0, -2, 5, 7, 1, 42, 9]) should return [1, 0, -2, 42, 9].
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 3 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY