I am willing to participate as a mentor for SymEngine and any project
regarding
the Diophantine equation module in SymPy.
Regards,
Thilina
On Tue, Feb 9, 2016 at 3:23 AM, Ondřej Čertík
wrote:
> On Mon, Feb 8, 2016 at 1:59 PM, Aaron Meurer wrote:
>
This is great news !!
Regards,
Thilina
On Thu, Mar 5, 2015 at 11:35 AM, AMiT Kumar dtu.a...@gmail.com wrote:
On Thursday, March 5, 2015 at 11:19:46 AM UTC+5:30, Ondřej Čertík wrote:
Hi AMiT,
On Wed, Mar 4, 2015 at 10:43 PM, AMiT Kumar dtu@gmail.com wrote:
Hi Ondrej,
From the
Hi Nguyen,
Sorry I took a lot of time to get back to you.
Please go through this article.
http://thilinaatsympy.wordpress.com/2013/06/21/solving-linear-diophantine-equation/
I am not sure whether we can do the fallowing assumption when solving* 2x +
3y + 4z = 5*.
Lets set x = x and assume y =
Thanks Ondrej for the reply.
Regards,
Thilina
On Wed, Mar 19, 2014 at 12:20 AM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Tue, Mar 18, 2014 at 10:18 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi,
I took a look at the Numerical libraries we can use. Both FLINT and LELA
which Ondrej pointed out earlier is released under BSD license
and I guess it's compatible with MIT license.
https://github.com/ContinuumIO/libdynd/blob/master/LICENSE.md
Any suggestions regarding this?
Regards,
Thilina
On Tue, Mar 18, 2014 at 7:06 AM, Thilina Rathnayake
thilina.r
structures.
On Sunday, March 9, 2014 4:26:28 PM UTC+1, Thilina Rathnayake wrote:
Hi All,
I would like to work on implementing a Linear Algebra Module for CSymPy
this summer
as a GSoC project. I like to focus mainly on Matrices and related
algorithms as they play
a central role in Linear algebra
On Mon, Mar 17, 2014 at 1:09 AM, Nguyen Tung iwonan...@gmail.com wrote:
Hi,
I've worked on the first issue you gave me:
diophantine(x**3-4*x*y**2+y**3-1)
I've found a bug in your classify_diop() that yields an error. In line
322, you put a '==' which should be '='. Bu
Yes that shoul be
On Mon, Mar 17, 2014 at 8:37 PM, Nguyen Tung iwonan...@gmail.com wrote:
And another question, I've read the paper you gave me containing the
algorithm that we want to implement. However, I think I don't really get
the idea (notations, methods ...). Is there any chance I can still
implement
Thank Ondrej for the reply.
Yes, it seems like the we'll have to go back to the original proposal
Regards,
Thilina
On Tue, Mar 18, 2014 at 5:05 AM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Mon, Mar 17, 2014 at 9:40 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi All
On Tue, Mar 18, 2014 at 1:23 AM, Nguyen Tung iwonan...@gmail.com wrote:
Hi,
Do we really need a complete re-implementation? If some areas (like Thue
equations) haven't been implemented, we'll work on those only.
We only need to re-implement the solutions for linear diophantine equations.
Hi,
You mean the areas we need to improve? I noted some of the areas we need
to improve in my first reply to you. Please have a look at that. Let me
know if
you have any problems with that.
Regards,
Thilina
On Sun, Mar 16, 2014 at 2:37 PM, Nguyen Tung iwonan...@gmail.com wrote:
Hello,
In
equations should be degree of one) I was so
confusing. Please be more specific
Thank you
On Sunday, March 16, 2014 11:14:24 AM UTC+2, Thilina Rathnayake wrote:
Hi,
You mean the areas we need to improve? I noted some of the areas we need
to improve in my first reply to you. Please have a look
Hi,
Nice to hear that you are working in fixing the issues. Did you find good
references for
the algorithms involved? I am eager to know how much of work you have done
on this.
Regards,
Thilina
On Sun, Mar 16, 2014 at 4:23 PM, Kumar Krishna Agarwal
kumar.1994...@gmail.com wrote:
Hi all,
Hi,
Below is the link for `factor_list()` documentation.
http://docs.sympy.org/latest/modules/polys/reference.html?highlight=factor_list#sympy.polys.polytools.Poly.factor_list
You can find documentation on functions, classes and Modules in online
sympy documentation.
Hi,
I don't see any problem in using other good packages with CSymPy.
That is why I said that if the user is willing to install other libraries we
should allow it. This might provide very fast and efficient functionalities.
But what if one of the packages we use is discontinued for some reason?
Thank you Ondrej and Tim for your inputs. I too think we should concentrate
on Symbolic matrix manipulation rather than the numerical matrices since
there
are good libraries we can use to do them.
The approach used in Armadillo is that if the user is willing to install
additional
libraries it
Hi Nguyen,
We need to improve the solutions for linear Diophantine equations
as the current implementation doesn't give you the complete set of
solutions. I made the following PR recently to correct this.
https://github.com/sympy/sympy/pull/7241
Also you can take a look at the two open issues
Hi Vincent,
As I have pointed out earlier one of the design goals of CSymPy
is to work without dependencies. Currently, only compulsory dependency
for CSymPy is the gmp library. Ondrej might able to explain this
more.
Regards,
Thilina
On Wed, Mar 12, 2014 at 6:26 AM, Vinzent Steinberg
Hi All,
I would like to work on implementing a Linear Algebra Module for CSymPy
this summer
as a GSoC project. I like to focus mainly on Matrices and related
algorithms as they play
a central role in Linear algebra.
I hope to implement following (rough) list of things related to matrices:
1.
Hi,
Thanks for the links. I'll have a look at them. I didn't even know they
existed.
Eigen is even used by Google. That's really interesting.
Regards,
Thilina
On Sun, Mar 9, 2014 at 9:50 PM, someone someb...@bluewin.ch wrote:
Hi,
Apart from SymPy matrices module, there are open source
:26:28 PM UTC+1, Thilina Rathnayake wrote:
Hi All,
I would like to work on implementing a Linear Algebra Module for CSymPy
this summer
as a GSoC project. I like to focus mainly on Matrices and related
algorithms as they play
a central role in Linear algebra.
I hope to implement following
I am not sure BLAS or LAPACK supports arbitrary precision arithmetic. If not
we have to go with FLINT.
Regards,
Thilina
On Mon, Mar 10, 2014 at 8:51 AM, Thilina Rathnayake
thilina.r...@gmail.comwrote:
Hi Mario,
Thanks for the reply.
One of the design goals of CSymPy is that user should
Hi All,
I wish to apply for in this year's GSoC as well and I am interested in doing
a project with CSymPy. I worked with Ondrej on implementing basic number
theoretic functionalities for CSymPy during the last few months. Below are
some PRs related to above work.
Thanks for the reply Ondrej.
On Thu, Mar 6, 2014 at 5:46 AM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Wed, Mar 5, 2014 at 4:25 PM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi All,
I wish to apply for in this year's GSoC as well and I am interested in
doing
a project
Wish you all a merry Christmas and Happy Holidays
Regards,
Thilina.
--
You received this message because you are subscribed to the Google Groups
sympy group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sympy+unsubscr...@googlegroups.com.
To post to
Great Job Ondrej !!! I wish we had something like that back here in
Sri Lanka.
Regards,
Thilina
On Wed, Dec 18, 2013 at 7:33 PM, Jason Moore moorepa...@gmail.com wrote:
Nice! How was the SciPy culture in India?
Jason
moorepants.info
+01 530-601-9791
On Wed, Dec 18, 2013 at 1:20 AM,
is
a bit complex.
On Wednesday, November 27, 2013 8:37:28 AM UTC-8, Thilina Rathnayake wrote:
Hi All,
I want to change the basic organization of Diophantine equation module so
that it can be extended and used more conveniently. Since I wish to
develop
the module for CSymPy also, I thought
On Sat, Dec 14, 2013 at 6:54 PM, Kumar Krishna Agarwal
kumar.1994...@gmail.com wrote:
Hi all,
I am Kumar Krishna Agarwal. I am presently a second year student, pursuing
my majors in Mathematics and Computing at IIT Kharagpur. Having followed
the development for quite sometime, I would like
Kirpichev
Stefan Krastanov
Manoj Kumar
Ronan Lamy
Oliver Lee
David Li
Stephen Loo
Aaron Meurer
Jason Moore
Rick Muller*
Markus Müller*
Mateusz Paprocki
Mario Pernici
Pablo Puente*
QuaBoo*
Thilina Rathnayake
Vinit Ravishankar*
Timothy Reluga
Julien Rioux
Matthew
Hi All,
I want to change the basic organization of Diophantine equation module so
that it can be extended and used more conveniently. Since I wish to develop
the module for CSymPy also, I thought this would be a good time to talk
about this.
Currently, the Diophantine module is invoked through
Thank you for the update Aaron.
Regards,
Thilina
On Tue, Oct 1, 2013 at 6:18 AM, Aaron Meurer asmeu...@gmail.com wrote:
The Google Summer of Code program has officially ended, and I'm happy
to announce that all seven of our students have passed.
This hopefully doesn't mean the end of their
Congratulations Ondrej on your awesome work
I wanted to actively take part in it but I got stuck with the GSoC project
and my college work. I hope to engage more with this project in the future.
This is especially helpful when solving equations like Thue equations
because the speed is
Hi Ondrej,
I completed a tutorial style introduction for the Diophantine module.
Please take a look at it when you have some free time. Here is the PR.
https://github.com/sympy/sympy/pull/2479
Regards,
Thilina
--
You received this message because you are subscribed to the Google Groups
sympy
in the process.
Regards,
Thilina.
On Tue, Sep 24, 2013 at 12:32 AM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
Thilina,
On Mon, Sep 23, 2013 at 12:14 PM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Congratulations Ondrej on your awesome work
I wanted to actively take part
Thanks for the update.
Regards,
Thilina
On Tue, Sep 24, 2013 at 1:50 AM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Mon, Sep 23, 2013 at 2:15 PM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Thank you for the reply Ondrej.
I will be more than happy to implement those
match4(t)
[(1, {z: 2, y: 2}), (-2, {x: 1, z: 2, y: 1}), (1, {x: 2, z: 2}), (-2,
{x: 1,
z: 1, y: 2}), (-2, {x: 2, z: 1, y: 1}), (1, {x: 2, y: 2})]
On Sunday, September 15, 2013 8:13:29 PM UTC+2, Thilina Rathnayake wrote:
Hi All,
Addressing issue 4004, the equation after
Hi All,
Addressing issue 4004https://code.google.com/p/sympy/issues/detail?id=4004,
the equation after expanding can be written as below,
In [1]: t = (x*y + y*z + x*z)**2 - 4*x*y*z*(x + y + z)
In [2]: expand(t)
Out[2]:
2 2 22 2222 2
x ⋅y - 2⋅x ⋅y⋅z
Hi David,
No, I haven't used it. Thanks for pointing that out, I'll have a look at it.
Regards,
Thilina
On Sat, Sep 14, 2013 at 4:25 PM, David Joyner wdjoy...@gmail.com wrote:
On Sat, Sep 14, 2013 at 4:42 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Ondrej,
In the past few
Hi All,
Is there a module in SymPy which can be used to calculate fundamental units
in
a number field and to solve the norm equation?
Thanks in advance.
Regards,
Thilina
--
You received this message because you are subscribed to the Google Groups
sympy group.
To unsubscribe from this group
Hi All,
I am trying to implement the solutions for cubic Thue equation and to do
that
I have to solve cubic equations. I use `solve()` to do this. But I am
having a little
trouble filtering out real solutions from the solution list returned by
`solve()`.
I tried the following.
In [5]: from
= solve(2*x**3 - 3*x**2 - 3*x - 1)
solutions[1].n()
2.26116669667966 - 0.e-23*I
solutions = [s.expand(complex=True) for s in solutions]
solutions[1]
1/2 + 3**(1/3)/2 + 3**(2/3)/2
On Wednesday, September 11, 2013 12:36:56 PM UTC+2, Thilina Rathnayake
wrote:
Hi All,
I am trying to implement
Hi Ondrej,
I implemented solutions to the general sum of squares. That is to the
equations
of the form x_1**2 + x_2**2 + . . . + x_n**2 = k. I made a commit. Please
take a
look at the following PR. The new function is named
`diop_general_sum_of_squares()`
and it's hooked to `diop_solve()` and
Hi Yaser,
I can't get it compiled since the statement is not defined.
Can you include few more lines of code so that it compiles?
And what is ``k`` here? Is it a number or a symbol?
Regards,
Thilina.
On Mon, Sep 9, 2013 at 10:02 PM, Mahmoud Yaser me.mahmoudya...@gmail.comwrote:
I am
Hi,
See if these links can help.
http://docs.sympy.org/0.7.3/aboutus.html
http://ondrejcertik.blogspot.com/
Regards,
Thilina
On Sun, Sep 8, 2013 at 1:50 PM, Christophe Bal projet...@gmail.com wrote:
Hello,
is there a little history of the birth and the evolution of Sympy ? I'm
Hi Ondrej,
I have encountered this also. Most of my commits do not show their
test status.
Regards,
Thilina
On Fri, Sep 6, 2013 at 10:21 PM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
Hi,
I noticed many times by now, that for some PRs, Travis does not report
the results (but it still
to reduce the problem
to a sequence of simpler problems.
I created issues for equation that can't be solved yet:
http://code.google.com/p/sympy/issues/list?q=label:Diophantine
otherwise I didn't find any bugs so far.
Ondrej
On Fri, Aug 30, 2013 at 11:29 AM, Thilina Rathnayake
thilina.r
And I will try to find how I can implement solving systems of Diophantine
equations.
If we run out of time for that, I can do it after the deadline. It's a nice
addition to the
module.
Regards,
Thilina
On Fri, Sep 6, 2013 at 8:52 AM, Thilina Rathnayake
thilina.r...@gmail.comwrote:
Hi Ondrej
Thanks ondrej, I will make a pull request improving docs.
Regards,
Thilina
On Tue, Sep 3, 2013 at 11:06 AM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Mon, Sep 2, 2013 at 10:02 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Ondrej,
I made a commit. Please take a look
siolution
diop_solve(x**2 - 2)
[-sqrt(2), sqrt(2)]
On Tuesday, September 3, 2013 10:20:04 AM UTC+2, Thilina Rathnayake wrote:
Thanks ondrej, I will make a pull request improving docs.
Regards,
Thilina
On Tue, Sep 3, 2013 at 11:06 AM, Ondřej Čertík ondrej...@gmail.comwrote:
On Mon
Hi All,
Currently, I can generate the coverage report by doing,
./bin/coverage_report.py
This runs all the tests and generate coverage report for every module. Is
there a way to
find the coverage of a single module by running only the tests related to
it?
Thanks in advance.
Regards,
that you won't use.
Aaron Meurer
On Sep 3, 2013, at 11:14 AM, Thilina Rathnayake thilina.r...@gmail.com
wrote:
In case of a uni-variable equation, I just passed the equation to
`solve()`. I forgot to
check whether the results were integers. I'll fix it. Thank you for the
information.
Regards
On Mon, Sep 2, 2013 at 7:26 AM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Sun, Sep 1, 2013 at 8:07 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi All,
Currently, this PR fails the travis build and sympy-bot tests. But when I
run the tests
locally, they all pass. I tried
, Thilina Rathnayake
thilina.r...@gmail.comwrote:
Hi Ondrej,
For some reason, Travis hasn't put the result of the test in front of the
commit.
Only the last build can be seen using the link provided by `Details` under
the PR's
Description. Here is the link to my last build.
https://travis
...@gmail.comwrote:
On Mon, Sep 2, 2013 at 1:01 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Finally got to know of the bug which was causing the problem.
Pernici has fixed it in #2430. After it gets merged, I can commit
my changes again and merge my PR.
Awesome! It's merged.
Ondrej
Hi Stephen,
I tried to build the docs, I got a different kind of an error.
$ make html
mkdir -p _build/i18n/
mkdir -p _build/html/tutorial
true
mkdir -p src/.static
mkdir -p _build/html
mkdir -p _build/doctrees
mkdir -p src/modules
PYTHONPATH=..: sphinx-build -b html -d _build/doctrees src
Hi All,
Currently, this PR https://github.com/sympy/sympy/pull/2303 fails the
travis build and sympy-bot tests. But when I run the tests
locally, they all pass. I tried testing in both python2 and python3, still
the tests pass. I merged
the branch with the current master and again ran the
1, 2013, at 7:53 AM, Thilina Rathnayake thilina.r...@gmail.com
wrote:
Hi Stephen,
I tried to build the docs, I got a different kind of an error.
$ make html
mkdir -p _build/i18n/
mkdir -p _build/html/tutorial
true
mkdir -p src/.static
mkdir -p _build/html
mkdir -p _build/doctrees
ones).
Aaron Meurer
On Thu, Aug 29, 2013 at 7:57 PM, Aaron Meurer asmeu...@gmail.com wrote:
On Thu, Aug 29, 2013 at 7:19 PM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Everyone,
I have completed most of my work related to Diophantine equation
Module. It
will be really
,
On Wed, Aug 28, 2013 at 1:44 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Ondrej,
I finished the last two deliverables(generalized pythagorean equation and
general sum of squares)
of my project over the weekend and I think now the project is almost
complete. But before
Hi Ondrej,
BTW, Thank you very much for the links and the reviews.
Regards,
Thilina
On Thu, Aug 29, 2013 at 12:12 PM, Thilina Rathnayake thilina.r...@gmail.com
wrote:
Hi Onderj,
I hope to work on improving documentation during this week. I added some
docstrings
to the Sphinx
at 10:19 PM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Thu, Aug 29, 2013 at 12:42 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Onderj,
I hope to work on improving documentation during this week. I added some
docstrings
to the Sphinx but they need to be improved.
Great
])
works. This is more of a design issue than an implementation one. We
need to figure out the right way to return parameterized solutions
from solve().
Aaron Meurer
On Wed, Aug 28, 2013 at 1:44 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Ondrej,
I finished the last two
Hi Ondrej,
I finished the last two deliverables(generalized pythagorean equation and
general sum of squares)
of my project over the weekend and I think now the project is almost
complete. But before pulling
those new code we have to merge the current PR first. Below is it's link
You only need to do the first command once per remote. The second
command will download changes. The third command will checkout the
remote branch locally.
Aaron Meurer
On Tue, Aug 20, 2013 at 2:04 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi All,
I recently
changes. The third command will checkout the
remote branch locally.
Aaron Meurer
On Tue, Aug 20, 2013 at 2:04 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi All,
I recently got a clone of Pernici's SymPy fork to review it.
But when I tried,
python ./bin/isympy
inside
Hi All,
I recently got a clone of Pernici's SymPy
forkhttps://github.com/pernici/sympyto review it.
But when I tried,
python ./bin/isympy
inside it, the following error occurred.
Traceback (most recent call last):
File ./bin/isympy, line 189, in module
main()
File
master branch, you may review in
another branch.
Thilina Rathnayake於 2013年8月20日星期二UTC+8下午4時04分07秒寫道:
Hi All,
I recently got a clone of Pernici's SymPy
forkhttps://github.com/pernici/sympyto review it.
But when I tried,
python ./bin/isympy
inside it, the following error occurred
Okay, I got it working. I had to create a new branch and had to pull from
Pernici's original branch, fixed few merge conflicts and it's working.
I guess this is what Stephen said, but I didn't understand it. Thanks again
Stephen.
On Tue, Aug 20, 2013 at 4:19 PM, Thilina Rathnayake
thilina.r
Hi Ondrej,
Finally, I am done with the improvements for the binary quadratic equations.
I improved the documentation a bit. But still there are some work to be
done.
I'll work on improving them towards the end of this week. I'll submit it as
a
separate PR.
When the Pernici's PR
...@gmail.comwrote:
Hi Thilina,
Thanks, I've merged it. Can you point me to the commit in your Diop.
module?
I'll have a look later tonight.
Ondrej
On Wed, Aug 14, 2013 at 3:00 PM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Ondrej,
I made a Pull request updating the README file. Please
Hi All,
Seems like there is a bug in factor_list() function in Python 3.2 and
Python 3.3
For example, factor_list(y**2 + x*y) fail in Python 3 versions.
Check the end of this Travis build report:
https://travis-ci.org/sympy/sympy/jobs/10036342
I am currently using python 2.7.5 for my GSoC
using Python 3.2
Here is the link to the failed build:
https://travis-ci.org/sympy/sympy/builds/10036334
Regards,
Thilina
On Sat, Aug 10, 2013 at 8:51 PM, Aaron Meurer asmeu...@gmail.com wrote:
On Aug 10, 2013, at 8:25 AM, Thilina Rathnayake thilina.r...@gmail.com
wrote:
Hi All,
Seems
at 8:25 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi All,
Seems like there is a bug in factor_list() function in Python 3.2 and
Python
3.3
For example, factor_list(y**2 + x*y) fail in Python 3 versions.
Check the end of this Travis build report:
https://travis-ci.org
Hi Ondrej,
I figured it out. thanks to your gist :D
Thilina
On Sat, Aug 10, 2013 at 11:26 PM, Thilina Rathnayake thilina.r...@gmail.com
wrote:
Hi Ondrej,
I did, but when I do something like `import sympy` in python3 command line
it gives an error saying no module named sympy. Do I need
Hi All,
I created an issue for this:
http://code.google.com/p/sympy/issues/detail?id=3968
Thilina
On Sat, Aug 10, 2013 at 11:29 PM, Thilina Rathnayake thilina.r...@gmail.com
wrote:
Hi Ondrej,
I figured it out. thanks to your gist :D
Thilina
On Sat, Aug 10, 2013 at 11:26 PM, Thilina
Hi Bhagya,
Welcome to SymPy !!!
As I have noticed, some trigonometric functions like tan and sin share the
same code.
Some functions like cot have the same code but with a slight difference.
How do you plan
to do the re-factoring? By creating a base class with the shared code and
using it as a
Hi All,
I thought of letting you know about the current status of the Diophantine
module.
Currently, It solves linear Diophantine equations, Quadratic binary
equations and
Quadratic ternary equations.
In quadratic binary module speed of the solving process can be increased
using
Hi All,
I want to find the exponents of the terms of an expression after using
factor().
For example:
from sympy import factor
from sympy.abc import x,y,z
a = x**2 + 2*x*y + y**2
terms = Mul.make_args(factor(a))
I can iterate through `terms` and for each term in terms I want to know
Thanks Manoj, That is exactly what I was looking for.
On Thu, Aug 1, 2013 at 6:09 PM, Manoj Kumar
manojkumarsivaraj...@gmail.comwrote:
Hi.
Suppose term = (x + y)**2
you can do either term.as_base_exp() , which gives (x + y, 2)
or term.args which gives (x + y, 2) , since term is a Pow
...@gmail.comwrote:
On Wed, Jul 31, 2013 at 11:13 PM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Ondrej,
I am planning to improve the algorithms used in solving binary quadratic
equation.
(Pernici pointed out some efficient algorithms). Should I commit these
changes in
a new branch
Thanks Aaron.
On Thu, Aug 1, 2013 at 10:26 PM, Aaron Meurer asmeu...@gmail.com wrote:
Use the factor_list() function instead of factor().
Aaron Meurer
On Thu, Aug 1, 2013 at 7:49 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Thanks Manoj, That is exactly what I was looking
get more simpler solutions. In this case we
can solve
y*(y - 7*x + 4z).
I will make a commit very soon.
Regards,
Thilina
On Fri, Aug 2, 2013 at 1:13 AM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Thu, Aug 1, 2013 at 11:26 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
The branch I
Hi Ondrej,
I made a commit. Please have a look at it when you are free.
PR: https://github.com/sympy/sympy/pull/2303
Regards,
Thilina.
On Fri, Aug 2, 2013 at 1:35 AM, Thilina Rathnayake
thilina.r...@gmail.comwrote:
Hi Ondrej,
There was a problem with the equation y**2 - 7*x*y + 4*y*z
, 2013 at 5:26 PM, Thilina Rathnayake
thilina.r...@gmail.comwrote:
Hi Ondrej,
Sorry for taking a lot of time to send you updates on the project. I had a
little busy
time since our university is having a drama festival and I had to
practice a drama for
it. It ends on upcoming Monday, so I
at 1:10 AM, Thilina Rathnayake
thilina.r...@gmail.comwrote:
Thanks mario for the great job.
Let me try your code.
Regards,
Thilina
On Wed, Jul 24, 2013 at 12:47 AM, Ondřej Čertík
ondrej.cer...@gmail.comwrote:
Thanks. Should we integrate it into sympy?
Ondrej
On Tue, Jul 23, 2013 at 1
to the square free part.
It is used the fast ``sqrt_mod`` in
https://github.com/sympy/sympy/pull/2307
On Saturday, July 20, 2013 7:40:05 PM UTC+2, Thilina Rathnayake wrote:
Thanks Ondrej for putting the link of the PR. I am sorry I forgot to put
it.
I am really grateful If other's
Čertík ondrej.cer...@gmail.comwrote:
On Fri, Jul 19, 2013 at 1:48 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Ondrej,
I thought of implementing the sieving method described in the book to
verify
the answers
returned by the descent method. It's simple to implement. What
ondrej.cer...@gmail.comwrote:
On Sat, Jul 20, 2013 at 11:25 AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi Ondrej,
I am pleased to say that I managed to implement the solutions for
quadratic
ternary forms.
Only thing we have to verify is that whether they are complete. I found
one
, 2013 at 1:43 PM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Seems like they haven't implement it anywhere else. I found an algorithm
that
was implemented in MAGMA, but it involves lattice reduction and since I
am
almost finished with the descent method, I didn't try to implement
to mario
for fixing them.
Regards,
Thilina
On Tue, Jul 16, 2013 at 11:13 PM, Thilina Rathnayake thilina.r...@gmail.com
wrote:
Thank you very much mario for the trouble taken. I'll let you guys know
whether
this fix works.
On Tue, Jul 16, 2013 at 7:43 PM, Ondřej Čertík ondrej.cer
We can add descent(23, 616) to the bug list too. It also return (None,
None, None)
but (6, 1, 38) is a solution. By finding more and more test cases which
fail, I think we can
identify a pattern and then the cause for the bug.
Regards,
Thilina
--
You received this message because you are
I should try making input coefficients to be square free. I think the
algorithm in general,
does not work when the coefficients are not square free.
On Thu, Jul 18, 2013 at 2:53 PM, Thilina Rathnayake
thilina.r...@gmail.comwrote:
We can add descent(23, 616) to the bug list too. It also return
``A 0, B 0``
On Thursday, July 18, 2013 11:28:22 AM UTC+2, Thilina Rathnayake wrote:
I should try making input coefficients to be square free. I think the
algorithm in general,
does not work when the coefficients are not square free.
On Thu, Jul 18, 2013 at 2:53 PM, Thilina
16, 2013 2:13:32 AM UTC+2, Thilina Rathnayake wrote:
Hi Ondrej,
Here is my attempt to debug:
http://nbviewer.ipython.org/94ee433a4dca26e3fee1
Regards,
Thilina.
--
You received this message because you are subscribed to the Google Groups
sympy group.
To unsubscribe from
, so that users know what it does. That
would be good start. If somebody later finds some other software that
can do this, or some other reference with examples and results, we can
make sure that it returns all the solutions.
Ondrej
On Sun, Jul 14, 2013 at 11:21 PM, Thilina Rathnayake
it? But the output [3] seems
incorrect to me, isn't it? Let me know which other output you found
incorrect.
I'll have a look at the book later.
Ondrej
On Mon, Jul 15, 2013 at 1:22 PM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
I attached the code herewith as a .py file so you can easily
Hi Ondrej,
Here is the notebook I created:
http://nbviewer.ipython.org/3dfe97025f06876820b4
Please let me know if anything needs to be changed.
Regards,
Thilina.
On Tue, Jul 16, 2013 at 2:26 AM, Thilina Rathnayake
thilina.r...@gmail.comwrote:
Hi Ondrej,
Thank you very much for the quick
Hi Ondrej,
Here is my attempt to debug:
http://nbviewer.ipython.org/94ee433a4dca26e3fee1
Regards,
Thilina.
On Tue, Jul 16, 2013 at 3:01 AM, Thilina Rathnayake
thilina.r...@gmail.comwrote:
Hi Ondrej,
Here is the notebook I created:
http://nbviewer.ipython.org/3dfe97025f06876820b4
Please
Mai*
Aaron Meurer
Angadh Nanjangud
Eric Nelson*
Sherjil Ozair
Mateusz Paprocki
Tarang Patel*
Khagesh Patel*
Mario Pernici
Luke Peterson
Tyler Pirtle*
Vasily Povalyaev*
Seshagiri Prabhu*
Pradyumna*
Roland Puntaier*
Bharath M R
Shravas K Rao*
Thilina Rathnayake*
Timothy Reluga
AM, Thilina Rathnayake
thilina.r...@gmail.com wrote:
Hi All,
I am planning to implement ternary quadratic forms, i.e equations of the
form,
a*x**2 + by**2 + cz**2 + fxy + gyz + hzx = 0. It would be better If I can
find
a system which currently implement this so I can validate my
1 - 100 of 136 matches
Mail list logo