How to use extended Eucledian Algorithm in this problem?

Revision en2, by Waynebot, 2019-07-07 20:30:00

Hello Everyone,
Problem
I am trying to solve this problem But stuck at some point. I used EX. Eucledian Algorithm to check whether Solution exist or not but not able to understand how to build logic to get total number of ways. Can you help me in solving this?

Tags #math, #gcd

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Waynebot 2019-07-07 20:30:00 15
en1 English Waynebot 2019-07-07 20:29:09 560 Initial revision (published)