Get Help

Turn on suggestions

Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

- Community
- :
- PTC Mathcad
- :
- PTC Mathcad
- :
- Diophantic linear Equations

Options

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page

Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

Highlighted
##

- Mark as New
- Bookmark
- Subscribe
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Notify Moderator

09-26-2017
05:12 AM

09-26-2017
05:12 AM

Diophantic linear Equations

Good morning to all,

currently i'm dealing with the theory of numbers where i have to find the solutions of a linear diophantic equation in common.

Is there any way in MP4 to call up a function for this problem, does there exist an implemented function in Prime for this?

Thanks in Advance

Volker

Volker

Labels:

6 REPLIES

- Mark as New
- Bookmark
- Subscribe
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Notify Moderator

09-26-2017
06:49 AM

09-26-2017
06:49 AM

Re: Diophantic linear Equations

The simplest linear Diophantine equation takes the form

,

where a, b and c are given integers, x, y — unknowns.

The solutions are completely described by the following theorem: This Diophantine equation has a solution (where x and y are integers) if and only if c is a multiple of the greatest common divisor of a and b. Moreover, if (x, y) is a solution, then the other solutions have the form (x + kv, y - ku), where k is an arbitrary integer, and u and v are the quotients of a and b (respectively) by the greatest common divisor of a and b.To find the solution one can use Extended Euclidean algorithm (except for a = b = 0 where either there are unlimited number of solutions or none).

Mathcad has a gcd function that will determine greatest common divisor. gcd(a,b)

You can determine if c is a multiple by testing the mod function for zero return. mod(c,gcd(a,b))=0 is pass

You could program to search for them.

- Mark as New
- Bookmark
- Subscribe
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Notify Moderator

09-26-2017
07:05 AM

09-26-2017
07:05 AM

Re: Diophantic linear Equations

So in summary i have to programm a routine because of the fact that there is no special function in MP4 for this.

THX anyway.

Volker

- Mark as New
- Bookmark
- Subscribe
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Notify Moderator

09-27-2017
02:46 AM

09-27-2017
02:46 AM

Re: Diophantic linear Equations

@vlehner wrote:

So in summary i have to programm a routine because of the fact that there is no special function in MP4 for this.

THX anyway.

File in Mathcad Prime 3.1 format attached.

Viktor

- Mark as New
- Bookmark
- Subscribe
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Notify Moderator

09-27-2017
03:51 AM

09-27-2017
03:51 AM

Re: Diophantic linear Equations

спасибо виктор,

In Mathacd 11:

Luc

- Mark as New
- Bookmark
- Subscribe
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Notify Moderator

09-27-2017
05:24 AM

09-27-2017
05:24 AM

Re: Diophantic linear Equations

Thanks Victor and Werner.

I tryed to run isolve() in MC15, and it will not work. Is it possible to run this function in MC15?

I have not the good old MC11.

Volker

- Mark as New
- Bookmark
- Subscribe
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Notify Moderator

09-27-2017
05:37 AM

09-27-2017
05:37 AM

Re: Diophantic linear Equations

No, isolve not work in MC15. It was an undocumented symbolics command in Mathcad 11.

Viktor

Top Tags