Given two prime numbers, P1 and P2, your task is to reach from P1 to P2 by changing only one digit at a time and also the number you get after changing a digit must also be a prime. For example suppose that P1 is 1033 and P2 is 8179 (both primes), we can reach from P1 to P2 in following way :- 1033-> 1733-> 3733-> 3739-> 3779-> 8779-> 8179. The first digit must be non-zero that is you can not go from 4-digit to 3-digit numbers. Note that there may be multiple way to get to destination but you have to find the way in minimum number of steps. For example the minimum number of steps to get from P1 to P2 in following examples are as follows:- 1033 8179 ANWSER:- 6 1373 8017 ANWSER:-7 1033 1033 ANWSER:- 0 Hint: Apply BFS

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...
icon
Related questions
Question
Given two prime numbers, P1 and P2, your task is to reach from P1 to P2 by changing only one digit at a
time and also the number you get after changing a digit must also be a prime. For example suppose that
P1 is 1033 and P2 is 8179 (both primes), we can reach from P1 to P2 in following way:-
1033-> 1733-> 3733-> 3739-> 3779-> 8779-> 8179.
The first digit must be non-zero that is you can not go from 4-digit to 3-digit numbers. Note that there
may be multiple way to get to destination but you have to find the way in minimum number of steps.
For example the minimum number of steps to get from P1 to P2 in following examples are as follows
1033 8179 ANWSER:- 6
1373 8017 ANWSER:- 7
1033 1033 ANWSER:- 0
Hint: Apply BFS
Transcribed Image Text:Given two prime numbers, P1 and P2, your task is to reach from P1 to P2 by changing only one digit at a time and also the number you get after changing a digit must also be a prime. For example suppose that P1 is 1033 and P2 is 8179 (both primes), we can reach from P1 to P2 in following way:- 1033-> 1733-> 3733-> 3739-> 3779-> 8779-> 8179. The first digit must be non-zero that is you can not go from 4-digit to 3-digit numbers. Note that there may be multiple way to get to destination but you have to find the way in minimum number of steps. For example the minimum number of steps to get from P1 to P2 in following examples are as follows 1033 8179 ANWSER:- 6 1373 8017 ANWSER:- 7 1033 1033 ANWSER:- 0 Hint: Apply BFS
Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY