descriptions to make understand where you are coming from and where
you are going. Thank you!!
- Help With The Following In Python Please Include Short Descriptions To Make Understand Where You Are Coming From And Whe 1 (383.73 KiB) Viewed 27 times
help with the following in python please include short descriptions to make understand where you are coming from and whe
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
help with the following in python please include short descriptions to make understand where you are coming from and whe
help with the following in python please include short
descriptions to make understand where you are coming from and where
you are going. Thank you!!
Gabriella has just made an incredible breakthrough in the world of encryption! Her new encryption algorithm allows communication between two people. Most of the details of this new encryption scheme are incomprehensible, but the crucial part of the encryption algorithm involves two intervals of positive integers. CHEESE The strength of the encryption algorithm is equal to the number of pairs of positive integers (one from each interval) that are relatively prime (that is, no positive integer other than 1 divides both numbers). For example, if the two intervals are [1, 2, 3, 4, 5] and [3,4,5,6], then the pairs (1,3), (1,4), (1,5), (1,6), (2,3), (2,5), (3,4), (3,5), (4,3), (4,5), (5,3), (5,4), (5,6) are all relatively prime. Thus, the strength is 13. Given the two positive intervals, what is the strength of the encryption algorithm? Input The first line of input consists of two integers, a and b (1 sa s b < 1012 and b - a s 10“), which are the two (inclusive) endpoints of the first interval. The second line of input consists of two integers, c and d (1 scsd S 1012 and d - < 5 106), which are the two (inclusive) endpoints of the second interval. Output Display the strength of the encryption algorithm. Sample Input 1 Sample Output 1 13 15 36 Sample Input 2 Sample Output 2 1232 10 50 51 100 Hints: This problem is an application of prime factors, Sieve of Eratosthenes and greatest common divisor (gcd)
descriptions to make understand where you are coming from and where
you are going. Thank you!!
Gabriella has just made an incredible breakthrough in the world of encryption! Her new encryption algorithm allows communication between two people. Most of the details of this new encryption scheme are incomprehensible, but the crucial part of the encryption algorithm involves two intervals of positive integers. CHEESE The strength of the encryption algorithm is equal to the number of pairs of positive integers (one from each interval) that are relatively prime (that is, no positive integer other than 1 divides both numbers). For example, if the two intervals are [1, 2, 3, 4, 5] and [3,4,5,6], then the pairs (1,3), (1,4), (1,5), (1,6), (2,3), (2,5), (3,4), (3,5), (4,3), (4,5), (5,3), (5,4), (5,6) are all relatively prime. Thus, the strength is 13. Given the two positive intervals, what is the strength of the encryption algorithm? Input The first line of input consists of two integers, a and b (1 sa s b < 1012 and b - a s 10“), which are the two (inclusive) endpoints of the first interval. The second line of input consists of two integers, c and d (1 scsd S 1012 and d - < 5 106), which are the two (inclusive) endpoints of the second interval. Output Display the strength of the encryption algorithm. Sample Input 1 Sample Output 1 13 15 36 Sample Input 2 Sample Output 2 1232 10 50 51 100 Hints: This problem is an application of prime factors, Sieve of Eratosthenes and greatest common divisor (gcd)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!