Web Images News Groups Scholar Blogs Gmail more »
Recently Visited Groups | Help | Sign in
Google Groups Home
Application of Diophantine equations
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
  8 messages - Collapse all  -  Translate all to Translated (View all originals)
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Konstantin Smirnov  
View profile  
 More options Oct 6, 9:19 pm
Newsgroups: sci.math
From: Konstantin Smirnov <konstantin.e.smir...@gmail.com>
Date: Tue, 6 Oct 2009 14:19:58 -0700 (PDT)
Local: Tues, Oct 6 2009 9:19 pm
Subject: Application of Diophantine equations
Dear number theorists,
what you can say about modern applications of Diophantine equations,
especially having large numbers solutions (>10^10-10^20)? In general,
number
theory is a standalone fundamental area, and Diophantine equations can
be
investigated only as a part of work in number theory. But can you
suggest
any significant applications that use Diophantine equations? If you
work
with such applications, please post what type of equations you use in
this area.
Mostly I am interested in equations like x^k+y^l+z^m=t^n. Is there any
practical benefit from them or such equations are only of theoretical
interest? What are main areas besides cryptography and coding?
Also what is the fastest program for search of solutions of such
equations? Mathematica, Maple, Pari GP or smth else?

Thanks
Konstantin


    Reply    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
maryK  
View profile  
 More options Oct 6, 9:40 pm
Newsgroups: sci.math
From: "maryK" <inva...@invilidinvalid.com>
Date: Tue, 6 Oct 2009 16:40:21 -0500
Local: Tues, Oct 6 2009 9:40 pm
Subject: Re: Application of Diophantine equations

"Konstantin Smirnov" <konstantin.e.smir...@gmail.com> wrote in message

news:8cbfba3b-d0fb-4dc9-a3f4-ea0cafcf3634@a6g2000vbp.googlegroups.com...

not much use for them
mathematical curiosities mostly

    Reply    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
I.N. Galidakis  
View profile  
 More options Oct 6, 9:59 pm
Newsgroups: sci.math
From: "I.N. Galidakis" <morph...@olympus.mons>
Date: Wed, 7 Oct 2009 00:59:11 +0300
Local: Tues, Oct 6 2009 9:59 pm
Subject: Re: Application of Diophantine equations

Konstantin Smirnov wrote:
> Dear number theorists,
> what you can say about modern applications of Diophantine equations,
> especially having large numbers solutions (>10^10-10^20)? In general,
> number
> theory is a standalone fundamental area, and Diophantine equations can
> be
> investigated only as a part of work in number theory. But can you
> suggest
> any significant applications that use Diophantine equations? If you
> work
> with such applications, please post what type of equations you use in
> this area.

Simple Diophantine equations have an application in video and lighting
technology. One area which I am aware of, is intereference of flickering light
sources and video capturing devices, or more generally, interference between
devices which capture scenery at a fixed rate of frames per second, and lights,
when the scenery is illuminated by lights whose frequency depends on the mains
frequency non-trivially:

http://ioannis.virtualcomposer2000.com/math/video.html

This is one of the solutions to the particular interference problem. The other
involves using ballasts which use lagging techniques to turn flickering lights
on and off in groups of n.

More is available if you Google "stroboscopic effect".

> Thanks
> Konstantin

--
Ioannis

    Reply    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Mensanator  
View profile  
 More options Oct 6, 10:40 pm
Newsgroups: sci.math
From: Mensanator <mensana...@aol.com>
Date: Tue, 6 Oct 2009 15:40:39 -0700 (PDT)
Local: Tues, Oct 6 2009 10:40 pm
Subject: Re: Application of Diophantine equations
On Oct 6, 4:40 pm, "maryK" <inva...@invilidinvalid.com> wrote:

Linear ones are useful, a form of which is the Hailstone Function

    X*a - Z
g = -------
       Y

in the Collatz Conjecture (where X,Y,Z are constants and we want
integer solutions for g and a).

One nice thing is that every Yth 1st generation solution is a second
generation solution, starting from the a1_kth solution, every third
generation solution is the Yth second generation solution starting
from
the a2_mth solution, every fourth generation solution is the a3_nth
solution, etc.

If you're lucky, and k = m = n = ..., then a closed form equation can
be derived such as this one for the ith, kth Generation Type [1,2]
Mersenne Hailstone:

Type12MH = 2**(6*((i-1)*9**(k-1)+(9**(k-1)-1)//2+1)-1)-1

This was derived from solving the linear congruence X*a == Z (mod Y)
which can be used to find solutions the the linear Diophantine
equation
given above. BTW, Type12MH(6,1) has 53338 decimal digits.

If you are unlucky, k != m != n ...

But with a little cleverness, you can make a recursive function with
generation one being X*a == Z (mod Y) which can be solved by

 a = gmpy.invert(X,Y) * Z % Y

and to get higher generations, merely use

 a = (((gmpy.invert(xyz[1]-xyz[0],xyz[1]**(k-1))*(xyz[1]**(k-1)-
prev_gen[2]))_
      % xyz[1]**(k-1))//xyz[1]**(k-2))*xyz[1]**(k-1) + prev_gen[3]

which solves the multigenerational linear Diophantine equation where
k,m,n,etc. are different.

For example

>>> sv = [i for i in range(666)] # sequence of 666 consecutive numbers
>>> xyz = cf.calc_xyz(sv)
>>> a = cf.geni(666,666,xyz)     # find the 666th instance of the 666th generation
>>> gmpy.numdigits(a)

211634                           # it has that many digits!

    Reply    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Robert Z  
View profile  
 More options Oct 30, 3:56 pm
Newsgroups: sci.math
From: Robert Z <t9353...@arcor.de>
Date: Fri, 30 Oct 2009 16:56:57 +0100
Local: Fri, Oct 30 2009 3:56 pm
Subject: Re: Application of Diophantine equations
Konstantin Smirnov schrieb:

> Dear number theorists,
> what you can say about modern applications of Diophantine equations,
> especially having large numbers solutions (>10^10-10^20)? In general,
> number
> theory is a standalone fundamental area, and Diophantine equations can
> be
> investigated only as a part of work in number theory. But can you
> suggest
> any significant applications that use Diophantine equations? If you
> work
> with such applications, please post what type of equations you use in
> this area.
> Mostly I am interested in equations like x^k+y^l+z^m=t^n. Is there any
> practical benefit from them or such equations are only of theoretical
> interest?

Substituting
x:=a
k:=2
y:=b
l:=2
z:=0
t:=c
n:=2
Sure this equation is only of "theoretical interest". No one needs a
right angle. And beeing able to read, write and calculate is a luxus
nowadays while we have such able politicians ... and entertaining folks
in newsgroups ...
--
RobertZ

    Reply    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Gerry Myerson  
View profile  
 More options Nov 2, 5:26 am
Newsgroups: sci.math
From: Gerry Myerson <ge...@maths.mq.edi.ai.i2u4email>
Date: Mon, 02 Nov 2009 16:26:15 +1100
Local: Mon, Nov 2 2009 5:26 am
Subject: Re: Application of Diophantine equations
In article <4aeb0c7f$0$6590$9b4e6...@newsspool3.arcor-online.net>,
 Robert Z <t9353...@arcor.de> wrote:

OK, we need right angles. Do we need right-angle triangles
in which each side is an integer?

--
Gerry Myerson (ge...@maths.mq.edi.ai) (i -> u for email)


    Reply    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Pubkeybreaker  
View profile  
 More options Nov 2, 1:19 pm
Newsgroups: sci.math
From: Pubkeybreaker <pubkeybrea...@aol.com>
Date: Mon, 2 Nov 2009 05:19:38 -0800 (PST)
Local: Mon, Nov 2 2009 1:19 pm
Subject: Re: Application of Diophantine equations
On Oct 6, 4:19 pm, Konstantin Smirnov <konstantin.e.smir...@gmail.com>
wrote:

> Dear number theorists,
> what you can say about modern applications of Diophantine equations,
> especially having large numbers solutions (>10^10-10^20)? In general,
> number
> theory is a standalone fundamental area, and Diophantine equations can
> be
> investigated only as a part of work in number theory. But can you
> suggest
> any significant applications that use Diophantine equations?

Yes.  Cryptography.  As you stated below.

    Reply    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Robert Z  
View profile  
 More options Nov 3, 8:10 pm
Newsgroups: sci.math
From: Robert Z <t9353...@arcor.de>
Date: Tue, 03 Nov 2009 21:10:45 +0100
Local: Tues, Nov 3 2009 8:10 pm
Subject: Re: Application of Diophantine equations
Gerry Myerson schrieb:

Thats a philosophic question.
Wikipedia says: "In mathematics, a Diophantine equation is an
indeterminate polynomial equation that allows the variables to be
integers only."
But the way from a non-integer right-angle triangle to an integer
right-angle triangle would be as interesting as the way from real
numbers to integers in the equation p*q=n.
--
RobertZ

    Reply    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
End of messages
« Back to Discussions « Newer topic     Older topic »

Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2009 Google