03-03-2010
I think you are better off to study theory first (math, science, physics) and after you get a solid education, you can decide where to apply it.
This is precisely why most universities teach theory for the first two years, and then you have electives moving forward. Each elective you take will help you understand what interests you.
There is nothing more important than a very solid math and science background. You cannot take "too much math" and it will help you in ways you cannot imagine now.
6 More Discussions You Might Find Interesting
1. Programming
I am now a student in university in 2nd year. I am studying computer science. But I am not sure what type of jobs computer science provide. I know some of them are software programming or network management. Recently, I hear some about Web Development. I wonder if it is a part of computer science.... (1 Reply)
Discussion started by: Anna Hussie
1 Replies
2. Web Development
I am now a student in university in 2nd year. I am studying computer science. But I am not sure what type of jobs computer science provide. I know some of them are software programming or network management. Recently, I hear some about Web Development. I wonder if it is a part of computer... (3 Replies)
Discussion started by: Anna Hussie
3 Replies
3. What is on Your Mind?
What is extent of influence of C language? How essential is it in today's computer and IT technology? Do you think that the inventor of C language deserves more recognition than he appreciates now? (1 Reply)
Discussion started by: Anna Hussie
1 Replies
4. What is on Your Mind?
I have added a new experimental "Computer Science and Mathematics Trivia - True or False" section in the discussions, currently under the tags box.
In the future, I plan to
Expand this feature to add more trivia categories from math, science and technology.
Keep track of correct and... (20 Replies)
Discussion started by: Neo
20 Replies
5. What is on Your Mind?
The UNIX and Linux Forums now has over 1000 TRUE / FALSE computer science and computer related trivia question in our database. These questions are of relatively high quality (compared to similar sites on the web) and are fun (according to feedback by users). In the first week during the... (1 Reply)
Discussion started by: Neo
1 Replies
6. What is on Your Mind?
Only a few days after I coded this new feature from scratch, we are seeing over 3000 entries in the database from members (mostly guests) playing CS trivia.
I have spend a lot of time coding this (from scratch) and testing the API. From the logs, it seems to have an API bug which appears... (31 Replies)
Discussion started by: Neo
31 Replies
LEARN ABOUT DEBIAN
numtheory
math::numtheory(3tcl) Tcl Math Library math::numtheory(3tcl)
__________________________________________________________________________________________________________________________________________________
NAME
math::numtheory - Number Theory
SYNOPSIS
package require Tcl ?8.5?
package require math::numtheory ?1.0?
math::numtheory::isprime N ?option value ...?
_________________________________________________________________
DESCRIPTION
This package is for collecting various number-theoretic operations, though at the moment it only provides that of testing whether an inte-
ger is a prime.
math::numtheory::isprime N ?option value ...?
The isprime command tests whether the integer N is a prime, returning a boolean true value for prime N and a boolean false value for
non-prime N. The formal definition of 'prime' used is the conventional, that the number being tested is greater than 1 and only has
trivial divisors.
To be precise, the return value is one of 0 (if N is definitely not a prime), 1 (if N is definitely a prime), and on (if N is proba-
bly prime); the latter two are both boolean true values. The case that an integer may be classified as "probably prime" arises
because the Miller-Rabin algorithm used in the test implementation is basically probabilistic, and may if we are unlucky fail to
detect that a number is in fact composite. Options may be used to select the risk of such "false positives" in the test. 1 is
returned for "small" N (which currently means N < 118670087467), where it is known that no false positives are possible.
The only option currently defined is:
-randommr repetitions
which controls how many times the Miller-Rabin test should be repeated with randomly chosen bases. Each repetition reduces
the probability of a false positive by a factor at least 4. The default for repetitions is 4.
Unknown options are silently ignored.
KEYWORDS
number theory, prime
CATEGORY
Mathematics
COPYRIGHT
Copyright (c) 2010 Lars Hellstrom <Lars dot Hellstrom at residenset dot net>
math 1.0 math::numtheory(3tcl)