From kde-edu-devel  Wed Mar 24 20:41:35 2010
From: Aleix Pol <aleixpol () kde ! org>
Date: Wed, 24 Mar 2010 20:41:35 +0000
To: kde-edu-devel
Subject: Re: [kde-edu]: Kprime Proposal
Message-Id: <757d9a551003241341u16f614d9y53daf0389d8b14f9 () mail ! gmail ! com>
X-MARC-Message: https://marc.info/?l=kde-edu-devel&m=126946333406029
MIME-Version: 1
Content-Type: multipart/mixed; boundary="--===============1043742653=="

--===============1043742653==
Content-Type: multipart/alternative; boundary=001517588f74c3b438048291f401

--001517588f74c3b438048291f401
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

On Tue, Mar 23, 2010 at 2:39 PM, Null K=C3=BChl <null.kuhl@gmail.com> wrote=
:

> Dear All,
>
>      I would like to propose the idea of a new application to the kde-edu
> set named: Kprime.
> Kprime is an application that belongs to the mathematics division, it has
> to do mainly with prime numbers.
> The main features will be as follows:
>
> - Prime Testing: Given a prime number or a set of prime number whether
> through program input, or a text file (given the delimiter between them),
> the program would check the primality of each and answer the user back.
> - Prime Generation: Generate all prime numbers between M and N, where M a=
nd
> N are given integers.
> - Visualization option of each of the previous process, also visualizatio=
n
> of the algorithms used in order to do the prime testing in general or the
> prime generation.
>
> Currently the algorithms for the testing / generation are already written
> and they are quite very fast.
>
> Kindly reply with comments or suggestions.
> Waiting for your feedback..
>
> Cheers,
>
> _______________________________________________
> kde-edu mailing list
> kde-edu@mail.kde.org
> https://mail.kde.org/mailman/listinfo/kde-edu
>
>
You can do the testing and generation with KAlgebra already (there's the
functions that do that somewhere, you just need to load the file).
I don't understand the visualization feature, maybe you could elaborate on
that.
If you want to create an app to be able to optimize such algorithms, I don'=
t
really think KDE Edu is the place to do that. You can improve the tools you
use to research them (debuggers, profilers) but I think this is out of KDE
Edu scope. Maybe you should twist your idea towards the user cases instead
of writing a prime numbers application.

Thanks :)
Aleix

--001517588f74c3b438048291f401
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div class=3D"gmail_quote">On Tue, Mar 23, 2010 at 2:39 PM, Null K=C3=BChl =
<span dir=3D"ltr">&lt;<a href=3D"mailto:null.kuhl@gmail.com">null.kuhl@gmai=
l.com</a>&gt;</span> wrote:<br><blockquote class=3D"gmail_quote" style=3D"m=
argin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); paddin=
g-left: 1ex;">
<div dir=3D"ltr">Dear All,<div><br></div><div>=C2=A0=C2=A0 =C2=A0 I would l=
ike to propose the idea of a new application to the kde-edu set named: Kpri=
me.</div><div>Kprime is an application that belongs to the mathematics divi=
sion, it has to do mainly with prime numbers.</div>

<div>The main features will be as follows:</div><div><br></div><div>- Prime=
 Testing: Given a prime number or a set of prime number whether through pro=
gram input, or a text file (given the delimiter between them), the program =
would check the primality of each and answer the user back.</div>

<div>- Prime Generation: Generate all prime numbers between M and N, where =
M and N are given integers.</div><div>- Visualization option of each of the=
 previous process, also visualization of the algorithms used in order to do=
 the prime testing in general or the prime generation.</div>

<div><br></div><div>Currently the algorithms for the testing / generation a=
re already written and they are quite very fast.</div><div><br></div><div>K=
indly reply with comments or suggestions.</div><div>Waiting for your feedba=
ck..</div>

<div><br></div><div>Cheers,</div></div>
<br>_______________________________________________<br>
kde-edu mailing list<br>
<a href=3D"mailto:kde-edu@mail.kde.org">kde-edu@mail.kde.org</a><br>
<a href=3D"https://mail.kde.org/mailman/listinfo/kde-edu" target=3D"_blank"=
>https://mail.kde.org/mailman/listinfo/kde-edu</a><br>
<br></blockquote></div><br>You can do the testing and generation with KAlge=
bra already (there&#39;s the functions that do that somewhere, you just nee=
d to load the file).<br>I don&#39;t understand the visualization feature, m=
aybe you could elaborate on that.<br>
If you want to create an app to be able to optimize such algorithms, I don&=
#39;t really think KDE Edu is the place to do that. You can improve the too=
ls you use to research them (debuggers, profilers) but I think this is out =
of KDE Edu scope. Maybe you should twist your idea towards the user cases i=
nstead of writing a prime numbers application.<br>
<br>Thanks :)<br>Aleix<br>

--001517588f74c3b438048291f401--

--===============1043742653==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
kde-edu mailing list
kde-edu@mail.kde.org
https://mail.kde.org/mailman/listinfo/kde-edu

--===============1043742653==--