Jump to content

Someguy1

Members
  • Posts

    25
  • Joined

  • Last visited

Posts posted by Someguy1

  1.  

    It would have helped if you had read it. What you are describing is finding primes which no one is contending can't be done. Again, there is no equation that generates Primes in the sense that there are equations that generate points on a parabola for example.

     

    In spite of your quibbling over imatfaal's wording, mathematicians know exactly what he means just as we know exactly what 'Primes are randomly distributed' means. Whether anyone else doesn't understand or agree is irrelevant. :)

     

    Well, I did read a couple of posts on this page and unfortunately my unease got worse. There is a failure to distinguish between "random" and "randomly distributed." For example the digits of pi are (strongly suspected to be) randomly distributed; but they clearly are not random. They are the output of a deterministic process.

     

    As are the prime numbers. I already showed how to generate them. Since they are the output of a deterministic process, they are not random. They have very low Kolmogorov complexity because there is a short algorithm that cranks them out. I gave one such algorithm.

     

    It's POSSIBLY true that the primes are randomly distributed, but I am not sure a good definition of that phrase has been given. There are a lot of suspected relationships between the distribution of primes and the Riemann hypothesis, for example. So it's likely that not only are the primes not randomly generated; they are also *possibly* not randomly distributed, either. Note the recent breakthrough on the twin prime problem for more evidence. We are learning more every day about the deep laws that determine the distribution of primes.

     

    As far as the squares of primes being 1 mod 6, that's obviously true. A prime must already be +/- 1 mod 6, so its square is 1. But many of the comments on the randomness of primes are not accurate.

  2. Peter - as we have discussed before there is no known process to generate primes

     

    I haven't read through this thread but because of the inaccuracy of this statement I feel compelled to jump in here.

     

    Of course we can generate primes. The Sieve of Eratosthenes is one such method. Eratosthenes lived around 200BC so this method is at least 2200 years old.

     

    http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

     

    If you imagine a magic black box programmed with the Sieve algorithm, we could push the ON button and it would sit there and spit out each and every prime number in numerical order for as long as we cared to run it.

     

    You may be thinking of a formula for primes. As Wiki puts it, "No such formula which is efficiently computable is known."

     

    http://en.wikipedia.org/wiki/Formula_for_primes

     

    That page summarizes a number of results that people have figured out in terms of prime-generating formulas.

     

    But if we generalize the word "formula" to "process," then there are lots of processes to generate primes. Here's another one.

     

    (1) Let x = 2.

     

    (2) Is x prime? If yes, print it. If not, don't print anything.

     

    (3) Let x = x + 1.

     

    (4) Go to (2).

  3. I was wrong in my original post - it is not true that a function which maps closed (sub) intervals to closed (sub) intervals is necessarily continuous. Here is a counter example:

     

    Define f(x) as sin(1/(0.5-x)) for 0 <= x < 0.5, f(0.5) = 0, f(x) = sin(1/(x-0.5)) for 0.5 < x <= 1. Then f is discontinuous at 0.5, because for all delta > 0, there exists points nearer to 0.5 whose values are 1.

     

    But the image of any subinterval containing the point 0.5 is [-1,1] ; and the image of any subinterval not containing 0.5 is also a closed interval, because the function is here continuous and the intermediate value theorem applies.

     

     

    I don't think this works. f is a continuous function. It's not defined at 0.5. At any point of its domain it satisfies the definition of continuity.

     

    By way of illustration, the function f(x) = x for x not equal 1/2; and f(1/2) = 47; is discontinuous at x = 1/2.

     

    But the function defined by f(x) = x on the domain R - {1/2} and undefined at x = 1/2; is continuous.

     

    The point is that we can't even ask about the continuity of my function or yours at x = 1/2, because it's not defined there.

  4. Check out the quaternions, the octonions, and the sedenions.

     

    * The quaternions have four generators 1, i, j, and k. How they relate to one another was discovered in a flash of insight by William Rowan Hamilton in 1843, as he was walking across Brougham bridge in Ireland. Hamilton was so struck by his discovery that he carved the relations among i, j, and k on the bridge; and a plaque commemorates the event till this day.

     

    http://en.wikipedia.org/wiki/Broom_Bridge

     

    Quaternion multiplication is not commutative. That is, it is not the case that xy = yz for quaternions x and y. Just as when we go from the reals to the complex numbers we lose the ability to say when one complex number is "less than" another; when we go to quaternions we lose commutativity. As you go up you always lose something.

     

    http://en.wikipedia.org/wiki/Quaternion

     

    Quaternions are actually used a lot in game programming, since they're a gadget for expressing rotations of three-space. Here's an interesting-looking article I found when I Googled, "quaternions and game programming."

     

    http://3dgep.com/?p=1815

     

    * Next up are the octonions, with eight units. Not only is multiplication not commutative, it's not even associative. So (xy)z need not equal x(yz).

     

    http://en.wikipedia.org/wiki/Octonion

     

    Here is John Baez's famous article about the octonions. This is the abstract of the article.

     

    The octonions are the largest of the four normed division algebras. While somewhat neglected due to their nonassociativity, they stand at the crossroads of many interesting fields of mathematics. Here we describe them and their relation to Clifford algebras and spinors, Bott periodicity, projective and Lorentzian geometry, Jordan algebras, and the exceptional Lie groups. We also touch upon their applications in quantum logic, special relativity and supersymmetry.

    * Then there are the sedenions, with 16 generators or units.

     

    http://en.wikipedia.org/wiki/Sedenion

     

    * It turns out that there is a general construction, and you can keep going up forever by powers of 2 to get various types of numbers.

     

    http://en.wikipedia.org/wiki/Cayley%E2%80%93Dickson_construction

  5. From the usual epsilon, delta definition of continuity, two significant theorems follow : (i) a function continuous on a closed interval attains in supremum and infimum on that interval ; and (ii) for any two values in the range of the function, any intermediate value also belongs to the range.

     

    From these theorems, one can deduce that the image of any sub-interval of the domain is a sub-interval of the range. And it turns out that this is a necessary and sufficient condition for continuity.

     

    So we can use this last as the very definition of continuity for a function on a closed interval. Some students, who find the conventional definition of 'continuity at a point' disconcerting, may find this preferable.

     

     

     

    It's true that a continuous function takes closed intervals to closed intervals (as long as you allow a single point to count as a degenerate interval, which is reasonable]. A continuous function does not necessarily take open intervals to open intervals. For example f(x) = x^2 takes (-1, 1) to [0, 1).

     

    As far as the converses, it's false that a function that takes open intervals to open intervals is necessarily continuous. The counterexamples are pathological. I'm not sure whether a function that takes closed intervals to closed intervals must be continuous. Do you have a proof?

  6. Let's unpack this a little by annotating as we go.

     

    p is prime, [latex]a\in\mathbb{N}, p\nmid a[/latex]
    Let [latex]A=\{a,2a,3a,\cdots ,(p-1)a\}[/latex]
    Now, we want to show that these p-1 numbers in A are all the nonzero residues mod p. In other words, no two of these are equal mod p. So, assume that two of them are equal.
    Let [latex]ra\equiv sa\pmod{p}[/latex] with [latex] 1 \leq r, s \leq p-1[/latex]
    Then: ra=mp+R and sa=np+R
    What is R? This is a little messy. I think I would just skip that line entirely since there's an easier way to go. Note that if [latex]ra\equiv sa\pmod{p}[/latex] then
    [latex]p |(ra - sa) = (r - s) a[/latex]
    Then you can apply the theorem that [latex]p \mid ab[/latex] implies that either [latex]p \mid a[/latex] or [latex]p \mid b[/latex], plus the fact that [latex]p \nmid a[/latex] to conclude that
    [latex]p | (r - s)[/latex]
    So [latex]r\equiv s\pmod{p}[/latex]
    But r and s are between 1 and p - 1, so the only way they can be equivalent mod p is if r = s. In other words, the set A contains a complete set of nonzero residues mod p in some order. That's what they mean by:
    The elements of A must thus all be different and congruent with the elements of the set [latex]B=\{1,2,3,\cdots ,(p-1)\}[/latex]. The sequence is not important.
    And now tell us the rest :)
  7. Could you explain the bit about Godel's theorem of incompleteness?

     

    Xerxes' reference was nonsense, as is most of his clever-sounding but incorrect exposition. DrRocket already made this point in post #6 above.

     

    Also note that this is a three year old thread.

     

    You'd be far better off just looking these topics up on Wikipedia and then asking specific questions.

  8. > Your title fails at the fundamental level of definition. A mathematical proof by definition cannot have a counter example.

     

     

    A mathematical proof most definitely can have a counterexample. Any inconsistent set of axioms will have lots of provable statements of the form "P and not-P". That's because an inconsistent system can prove anything. In fact the only way we can possibly ever hope to have a complete set of axioms for math is to start with an inconsistent set of axioms. That's Godel's incompleteness theorem. It says that the axioms of set theory are complete if and only if they're inconsistent.

     

    Note that it doesn't say which of these two cases is true! Everyone assumes that set theory is incomplete. But it's possible that it's complete, but inconsistent.

     

    To explain this in a bit more detail, what is a proof? A proof is a set of statements, each one following logically from the axioms and from previous statements. It says nothing about whether the axioms are self-contradictory. If they are, then you'll be able to prove P and not-P for any proposition P that you care to choose.

     

    As far as whether the foundations of math are in peril, they most certainly are. As I said earlier, ZF is less than 100 years old. It's highly historically contingent. People did math for thousands of years without it.

     

    Set theory as the foundation of math is already under genuine attack from a variety of directions. Computability and complexity theory, Category theory, and Homotopy Type Theory are already three promising avenues of research into alternate foundations.

     

    Here is a thought question for you. Given any axiom system, a theorem has a proof. That's by definition of proof, which is "a statement that can be logically derived from the axioms." Therefore (once we fix our formal language) any theorem has a shortest proof.

     

    Now, suppose that there is a contradiction in the set theory.

     

    Therefore, some contradiction has a proof in ZF. Now: What happens if there is some provable contradiction in ZF; but the length of the shortest proof of that contradiction is larger than the number of quarks in the universe?

     

    In that case set theory would be known to be inconsistent; but it wouldn't matter the slightest bit to anyone; because you can be certain that any proof that you can possibly write down, is not a contradiction.

     

    Inconsistent axiom systems are not meaningless or trivial. They turn out to be interesting!

  9. If the original proof was correct (logically following from the axioms) and the existence of a counterexample could be proven from the same axioms (again, assuming a correct proof) then the axiom system would be inconsistent.

     

    Would this be a bad thing for math? Not really. The Zermelo-Fraenkel axioms of set theory are less than 100 years old (dating from 1922), yet mathematicians got along fine without them since ancient times. If ZF turns out to be inconsistent, foundationalists will just get busy fixing up new foundations. In fact this process is well underway. Serious people are already developing a brand new foundation for math not based on set theory

     

    http://en.wikipedia.org/wiki/Homotopy_type_theory

     

    But suppose set theory turns out to be inconsistent and no new foundations are available yet? It still won't trouble most working mathematicians. They'll still do their work in analysis, algebra, geometry, number theory, etc., just as they did before ZF.

     

    After all, set theory may be inconsistent, but 5 is still a prime number. So people who study prime numbers won't be troubled in the least.

  10. Like I said, it's numbers sorted into order.

     

    Thus 1,2,3,4,5,6,7,8,9 is maths.

     

    But 7,2,5,3,9,1,8,4,6, is only random numbers.

     

    This is an excellent example to show the flavor or sense, if not the meaning, of math.

     

    One of the things mathematicians study is order. If we have the set {1,2,3,4} we can order it in several ways. [Let me just use a four-element set for simplicity]

     

    One way to order them is called the "usual" or "standard" order, 1 < 2 < 3 < 4.

     

    Another way to order them would be 2 '<' 4 '<' 3 '<' 1 where I'm putting the < sign in single quotes to indicate that this is not the same as the usual way of ordering these four numbers.

     

    Now, this is perfectly legitimate. As an everyday example, suppose you are a schoolteacher in charge of a class of kids and you tell them to line up by height. Then you tell them to line up by weight. Then you tell them to line up alphabetically by last name. Then you tell them to line up alphabetically by first name. Or in reverse order of their score on the math test.

     

    You can see that given a set of objects, there are many ways you can impose an order on them. There are many ways you can impose an order on the set {1,2,3,4}. How many ways? Well, you have free choice for the smallest element of the order. Then you only have 3 choices left for the next element, then 2 choices, then 1 choice. So you can order {1,2,3,4} in 4*3*2 = 24 different ways.

     

    So we have a theorem: There are exactly 24 ways to line up four objects in some order. It doesn't matter if the objects are school kids, apples, planets, universes. If there are 4 of them, then there are 24 different ways to line them up in some order.

     

    Now, what is math? Math is the subject that can say something sensible about all the different ways you can put a set of four objects into an order.

     

    In math we don't care that these are four numbers, four school kids, four cows, or four universes. In math all we care about is the number 4.

     

    That's math. Math is an organized body of knowledge that cares about numbers, shapes, and relationships among things, without caring about the nature of the things themselves.

  11.  

    The second question does not follow from the first being true, which it is.

     

     

     

    I was not able to parse that. Are you saying that there are uncountably many points but I'm not allowed to ask how many there are?

     

    Someone suggested that the universe is a continuum. But we know quite a lot about continua from math. We know, for example, that they must contain uncountably many points, if the real numbers are taken as a model for the continuum.

     

    Is there some model for a continuum other than the real numbers? One that contains countably many points?

     

    I'm assuming that we are examining the notion that physical space consists of points, which are to be taken in the same sense as mathematical points. Identifiable with real numbers, for example. Dimensionless.

     

    So we have an uncountable set of points in a given region of space. I am asking, what is the cardinality of this set of points? If space is modeled accurately by the real numbers, then there are 2^Aleph-0 points in, say, any finite-dimensional region of space, bounded or not.

     

    I am asking if that's Aleph-1 or some other Aleph. If the game is to assume that actual, physical space is accurately modeled by the real numbers, then this becomes a question of physics, subject to experiment.

     

    I am pointing this out, in order to cast doubt on the idea that space is accurately modeled by the real numbers. It's not currently a mainstream idea. The mathematical reals are a continuum; but the physical universe is generally taken to be quantized. Of course this is not the last word on the matter, but it's what the preponderance of experts believes right now.

     

    But if space truly consists of a real-number-like structure, then the puzzles of set theory become matters of physics: subject to experimentation; and having a definite truth value in our universe.

     

    Of course I could make the same argument about the Axiom of Choice. And if AC turned out to be true about the physical universe, then the Banach-Tarski paradox would be a true fact about physical things!

  12. But it might be true for energy or space-time. If we look at energy or space-time as continuous like the real number line, then maybe infinitesimal energies or infinitesimal distances apply. A physicist once told me that a Planck's constant is not necessarily the smallest possible quantity of energy, just the smallest detectable quantity of energy.

     

    If that's true, then there must be uncountably many points in a one centimeter line segment. If so, exactly how many points are there? The Continuum Hypothesis would then be a proposition with a definite truth value in the physical universe; and we would expect physics postdocs to apply for grant money to do experiments to find evidence either in support or in opposition to the truth of CH. I've heard of no such grant applications. There's no evidence that there are infinite sets of points in the physical universe. On the contrary, there are far less than a googol (10^100) quarks in the universe.

     

    Of course it's entirely possible that we'll all feel differently after another few hundred years of scientific research. But there is no evidence in contemporary physics that the world is made up of an infinite number of dimensionless points.

  13.  

    Actually it is on topic since it addresses the OP.

     

    You have already been told by a moderator that your approach is off topic.

     

    Although you have not answered my question, I will answer yours

     

    (1) The question is flawed since the units are different on either side of the equation.

    Couch your question correctly and I will try again.

     

    (2) For the purpose of many physical models (already described) yes that is true. It is not a belief system, but a matter of definition.

     

    I'm afraid that if I was sanctioned by a moderator, I missed it, I have no private messages. Did I miss something? Or are you confusing me with someone else? I certainly have no desire to transgress the etiquette of the forum.

     

    The OP asked how many infinitesimals are in a kilogram. This (to me) is an opportunity to explain to the OP the distinction between math and physics; and not to obfuscate it.

     

    So ... how many infinitesimals are in a kilogram? I really don't understand your point of view at all. Nor your refusal to respond to whether you truly believe that a kilogram of physical stuff can be decomposed into infinitely many pieces of size 1/2^n.

     

    (ps) Earlier you were adamant that the OP was asking about math. But he said kilogram. And I wonder if this is the source of our different viewpoints. A kilogram is a concept from physics. There is no such thing as a kilogram in mathematics. I am thinking that you don't agree with that. Because earlier you claimed that a statement involving kilograms was a statement of math. But it can never be. The word kilogram is part of physics and definitely not part of math.

  14. Are you saying that the following are not true and should not therefore be taught to final high school / tech college / first year undergrads?

     

    [math]\bar x = \frac{{\iiint {\rho xdxdydz}}}{{\iiint {\rho dxdydz}}}[/math]

     

    [math]{I_{xx}} = \int {\rho ({y^2} + {z^2})dv} [/math]

     

     

    That's a complete non-sequitur. I asked you two questions:

     

    1) How many real numbers are in a kilogram?

     

    2) Do you literally believe that a kilogram of gold can be decomposed into infinitely many parts, each part of mass 1/2^n kilograms for n = 1, 2, 3, ...?

  15.  

    No, physics was not implied, maths was explicity called for since the OP not only posted in the maths section as opposed to the physics one, but further chose an area of pure maths over applied maths.

     

    In any case your argument that an infinite number of physical points cannot make up 10 kg is suspect.

     

    A vast area of physics, including most of classical physics is predicated upon the premise that you can indeed either infinitely divide a finite piece of matter or alternatively assemble a finite piece from an infinite number of parts.

    This underlies classical statics and dynamics, continuum mechanics, and even the angular momentum of quantum particles is derived from continuum mathematical analysis.

     

    Can you tell me any reason why, if each of the numbers in my series posted above was a mass coefficient, I could not assemble 1.6 kg from the first series and 1.2 kg from the second and any other value by suitable scaling?

     

    How many real numbers does it take to make a kilogram?

     

    The fact that the OP is confused about the distinction between math and physics is not a reason to amplify his confusion. Rather, it was an opportunity to clarify his misunderstanding. I know of no theory of physics that incorporates infinitely many tiny objects as constituents of matter. As I noted, there are far fewer than 10^100 quarks in the universe. That's a relatively small finite number.

     

    That's my take on this. There is a huge amount of confusion online regarding the distinction between math and physics. And telling someone that you can add up infinitely many tiny things to make a kilogram of some physical substance is truly and deeply wrong.

     

    But let me ask you this. Do you actually believe that a kilogram of gold is made up of 1/2 k plus 1/4 k + ... ? I assume you understand that this is false. But perhaps I'm misunderstanding you, and you actually believe this is true. If it's false, then you've confused and misdirected the OP. If you believe it's true, state that clearly so that I understand better where you're coming from.

  16. I am really confused over the general idea of the summation of infinitesimals of some quantity. For example, can anyone show me mathematically how an infinite number of dm can either equal 5 kg's or 10 kg's? I can understand basic calculus.

    It's not possible for infinitely many physical things to make up a kilogram. If you take a kilogram of any material substance and subdivide it finely enough you'll end up with a large but finite number of subatomic particles. There are only finitely many quarks in the universe, far less than 10^100 in fact.

     

    It's true that there are infinitely many points in a mathematical line segment, but that has nothing to do with the physical world.

  17. Okay, maybe I misunderstood the article.

    Then what is "formal" power series?

     

    WIll the techniques differ in finding power series, asymptotic series and formal power series? By techniques, I mean "proper" algorithms used in computer science as I'm interested in implementing these. Thank You!

    A formal power series is an expression that you don't substitute back into. In other words you have some power series, and you can add it to some other power series; or you could multiply it by some other power series. So the set of all power series in (say) one variable, is itself an algebraic object. You're just manipulating expressions. But you're not plugging in values of x and taking limits. Does that make sense? For example you can do the same trick with formal polynomials. x+2 plus 3x+5 = 4x+7 as formal polynomials that have no meaning or interpretation beyond their syntax.

  18. No, it's not a homework problem, it's a random thing I was working on when playing around with algorithms to convert between music and systems of math.

    I have these terms,

     

    [MATH](1/1)x+(1/3)x^3+(1/15)x^5+(1/105)x^7+(1/945)x^9[/MATH]...

     

    And I'm trying to come up with a formula to describe the coefficients in terms of a summation as part of a larger formula that I've already broken down. I've spent more than two hours testing different formulas and none of them work, but I know the concise pattern. If you want the nth coefficient, you'd do 1 divided by the derivative of the nth term times the coefficient (n-1)th term times the coefficient of the (n-2)nd term times the coefficient of the (n-3)rd term and so on. In a sense, it's like a factorial based off of derivatives, but I can't figure out a formula for it in terms of Sum(n=1) n->infinity. if n starts at 0, it's x^(2n-1), I got that down, I just can't figure out the coefficients, it's some kind of alternative factorial.

     

    Denominators are double factorials of odd numbers. Next few are 10395,135135, 2027025, 34459425, 654729075, 13749310575, ...

     

    http://oeis.org/search?q=1%2C3%2C15%2C105%2C945&language=english&go=Search

  19. I understand that anything other than zero to the zero power equals one. But this doesn't seem to make sence to me. Could someone explain how this is, rather than that it is? I'd like as much feedback on this as possible. Thank you.

    Here's one way to think about it. 64-32-16-8-4-2-1 are the following powers of 2: 6,5,4,3,2,1,0. In other words, 0 is just the obvious number in the downward sequence of powers. And the pattern continues to the negatives. 2^(-1) = 1/2, 2^(-2) = 1/4, etc. The number in the middle of this process, 1, must be 2^0. It's just completing the pattern in the obvious way.

     

    In other words:

     

     

    n 2^n

    -----------

    -2 -- 1/4

    -1 -- 1/2

    ?? -- 1

    1 -- 2

    2 -- 4

    3 -- 8

     

    It makes sense to write 2^0 = 1.

     

    Of course this isn't a proof, just a heuristic argument.

  20. Yes, that is similar to what studiot brought up earlier, where there are infinite real numbers between two real numbers 1 and 2. It is bounded, but infinitely large.

    No, my example is very different. There are infinitely many real numbers between 1 and 2, but each real number has zero length.

     

    In my example, there are infinitely many nonzero lengths whose union is finite.

     

    I'm just trying to figure out what you're asking.

  21. But, then that must mean a fractal that only takes up a finite area of space is infinitely large because it has infinitely repeating fractal "tails", and therefore by definition has infinite size, but this is not the case.

    Ah, perhaps do you mean something like taking the unit interval, which has length one, and dividing it into infinitely many nonzero pieces of size 1/2, 1/4, 1/8, 1/16, ... etc? In that way we have infinitely many intervals, each interval has nonzero size, yet their union has size one.

     

    Is this what you are asking? I confess I'm having a hard time understanding your specific question.

  22.  

     

    Someguy1, are you sure of your terminology?

    Did you mean proper subset?

     

    What are the subsets of X = {R,Q,Z} ?

    I wrote exactly what I meant. What I wrote is mathematically correct. I'm a little puzzled by your comment, since what I wrote is so widely known.

     

    There are eight subsets of X, just as there are eight subsets of any set of 3 elements. Do you disagree? The eight subsets are:

     

    1. The empty set.

     

    2. {R}

     

    3. {Q}

     

    4. {Z}

     

    5. {R, Q}

     

    6. {R, Z}

     

    7. {Q, Z}

     

    8. {R, Q, Z}

  23. Let's say you have a set A which consists of a subset B. Now, let's say that subset B contains infinite elements within it, but within the bounds that it would be finite in order to fit within the constraints of the finite of A. Would this be possible?

     

    I am trying to get me head around the idea that something can be infinitely small, like how there are infinitely many branches within a finite area of a fractal and yet it can't be infinitely larger than the set that contains it because it would seem a paradox would arise. I might need to clarify, so if it is confusing just ask me to clarify this.

     

     

    It's perfectly ok for an infinite set to be an element of a finite set. For example if R, Q, and Z are the set of real numbers, the set of rational numbers, and the set of integers, respectively, then the set X = {R, Q, Z} is a set containing exactly three elements.

    But an infinite set can never be a subset of a finite set, since the cardinality of a subset must be less than or equal to the cardinality of the original set.

×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.