Prime Time - James Maynard

Sdílet
Vložit
  • čas přidán 14. 02. 2019
  • Oxford Mathematics Public Lectures: James Maynard - Prime Time: How simple questions about prime numbers affect us all.
    Numbers are fascinating, crucial and ubiquitous. The trouble is, we don't know that much about them. James Maynard, one of the leading researchers in the field explains all (at least as far as he can).
    Oxford Research Professor James Maynard is one of the brightest young stars in world mathematics, having made dramatic advances in analytic number theory in recent years.
    The Oxford Mathematics Public Lectures are generously supported by XTX Markets.

Komentáře • 54

  • @markbarden3401
    @markbarden3401 Před 4 lety +23

    A very good introduction to prime numbers accessible to non-mathematicians like myself. I want to know more.

  • @piyushdamor4826
    @piyushdamor4826 Před rokem +73

    Who is here after He won fields madel .

  • @earthworm8832
    @earthworm8832 Před 5 lety +27

    He loved that "space in the slide" joke didn't he? haha

  • @dadt8009
    @dadt8009 Před 3 lety +3

    A brilliant talk for "public understanding".

  • @johnchessant3012
    @johnchessant3012 Před rokem +20

    2022 Fields medalist!

  • @kamilziemian995
    @kamilziemian995 Před rokem +2

    Very beautiful and very simple introduction to prime numbers and number theory.

  • @yessikaalexandraperezvilla9666

    HEY THANKS FOR THIS TYPES VIDEOS.... GREETINGS FROM BOGOTA COLOMBIA!

  • @rainerausdemspring894

    Not all problems concerning the addition of whole numbers are trivial. The theory of additive sub-monoids (or additive sub-halfgroups) of the whole numbers is extremely difficult.

  • @EdMcF1
    @EdMcF1 Před 10 měsíci +1

    What if primes just 'are', and looking at them is an artefact of simply asking which whole numbers are only divisible as an integer by 1 and itself?

  • @luisfelipe7351
    @luisfelipe7351 Před 2 lety

    ------------------------------0.46
    between each increment probably goes on forward in that relation

  • @prakashbhanwariya6386
    @prakashbhanwariya6386 Před 4 lety +1

    Best

  • @Faisal710
    @Faisal710 Před 2 lety

    how can someone tell that a number is prime or composite without knowing the factor of a number

  • @simondavis8634
    @simondavis8634 Před 5 lety +12

    If the Riemann Hypothesis was discovered to have a solution would this lead to major security issues with worldwide consequences?

    • @OxfordMathematics
      @OxfordMathematics  Před 5 lety +12

      We don't know but brows are furrowed...

    • @earthworm8832
      @earthworm8832 Před 5 lety +3

      I think only if it was DISproved

    • @shomrikb
      @shomrikb Před 4 lety +6

      No, not really. If quantum computers are easily available then there might be problems. However, there's something called post quantum cryptography too, just in case.

    • @holliswilliams8426
      @holliswilliams8426 Před rokem

      I don't think so.

    • @Faisal710
      @Faisal710 Před rokem

      @@OxfordMathematics it's time for prime numbers mysteries to end now

  • @stormymangham5518
    @stormymangham5518 Před rokem +1

    What happens if you teach a deep machine learning platform to count only prime number series? I guess whole numbers would have to be somehow implied simply to teach the concepts of primes?

  • @crazytactics3603
    @crazytactics3603 Před rokem

    I'm sure i am just missing something but aren't prime numbers also whole numbers, if so I don't understand how prime numbers are the building blocks of whole numbers and are themselves also whole numbers. Like using the word in it's definition. I'm confused

    • @firemaniac100
      @firemaniac100 Před rokem +1

      any positive integer is factorizable in prime numbers. Start whth the number and ask the question is this number divisible or not? If it's not your number is prime, otherwise there are at least to factor not necessarily distinct, then apply the same reasoning to these to factors and sketch it has a tree whose nodes are such factors. It's obvious that these tree has a finite depth since you cannot get factors arbitrally small, and its leafs are prime numbers. Since the product of all tree leafes is equal to the starting number, the conclusion is that the starting number is composed solely by prime numbers which can be thought has the atoms of the molecule(starting number). Note also that different leafes may be the same prime number and therfore the starting number = p_1^k1 * p_2^k2 * ... where the k are the number of times a given prime appears as a leaf.

  • @Bestofchatgpt
    @Bestofchatgpt Před 3 lety +1

    26:46

  • @Faisal710
    @Faisal710 Před 2 lety

    I am working on factorizing that large number given in the video but if I ever succeed in my task how can I get the price mentioned in the video

  • @EmilyPerez-ux6cz
    @EmilyPerez-ux6cz Před 5 lety +6

    El presentador es tan guapo. 💕

  • @Hxuehhxiwb
    @Hxuehhxiwb Před 5 lety +10

    I am curious about what the ‘whiteboard’ is made of lol

  • @Faisal710
    @Faisal710 Před 2 lety

    I want to meet this man I know the solution of the problems he is talking about How can I contact him

    • @Schpeeedy
      @Schpeeedy Před rokem +3

      what solution do you know

    • @terrykilshaw8970
      @terrykilshaw8970 Před rokem +1

      Try Oxford University.

    • @theherk
      @theherk Před rokem +1

      Maybe you can share a reference to your writings on the topic.

    • @holliswilliams8426
      @holliswilliams8426 Před rokem

      You could try sending him an email but he will ignore it if looks like obvious quackery (just to warn you).

    • @Faisal710
      @Faisal710 Před rokem

      @@Schpeeedy I want to tell him that prime numbers are distribution is related to their LCM and it is not so difficult to find primes numbers. I wonder why people for thousands of years did not notice the relation of prime numbers distribution and their LCM relationship

  • @IKnowNeonLights
    @IKnowNeonLights Před rokem

    We study number theory, and we can say that we don't know where the next prime number is going to be, said the mathematicians!!!
    While holding a times table on their hand, (a grid one just like a spreadsheet)
    Prime numbers seem to be a trick derived from words such as times table.
    All of them seem to be odd numbers except number two the first prime, which is the condition ( that of two factors that are not equal whole numbers or both one as in the case of number two), without any exception.
    Meaning that their true characteristic is the fact that no prime number can be divided in to two exactly the same whole numbers, just like any odd number cannot either, except number two which is not odd, but should be odd just like all the other prime numbers.
    By starting with number two and making use of multiplication and division, the construct of the trick has been added making them prime, whatever that is.
    (I strongly suspect, for the purpose of having a sixty second minute and a sixty minute hour, giving the perfect illusion that time/future/prime cannot be predicted)
    To state that the numbers from zero to nine on their own are that and that only is stupid and trickful.
    Especially when the same effect is not attributed if faced with two numbers.
    Meaning the times table starts with number two, (two times one, not even at two times one, but with two times two, two times three and so on,) in order for there to be prime numbers.
    From there I suspect, and as I have stated before in another video about prizes, the trick makes use of the philosophical/mathematical concepts of axioms, in this case with the only whole numbers there actually are.
    That of zero to nine.
    These axioms should be something around these meanings.
    Numbers.
    0 is A forever. At any point in the zero is the beginning, the now and the end in a forever loop, dependent upon nothing.
    1 is a zero cut and straighten, with a small variation, that of the top dent looking towards down. Meaning, I am the beginning of something, but not the beginning, the now and the end.
    2 is a one trying to find it's way, any way, here there, somewhere, let's make a start, left and right.
    3 is a balanced two. We have a beginning of something, we start moving at a direction, let us keep a balance between the beginning and the movement. A middle of some sorts.
    4 is the try to be precise and fair. Half here, half there. Equilibrium.
    5 is the true equilibrium. Half here, half there, with one remaining the mutual but not owned beginning.
    6 is the first attempt to make good on a five, the true equilibrium, by adding a small zero, and a dented one, keep going with what is good for as long as you can, with the chance to begin again.
    7 is the consolidating wisdom of all the previous numbers, bringing them all up, right and ready to be deployed at wish, except the zero.
    8 is the understanding of A eternity, your eternity, overlapping itself, not the zero eternity.
    9 is the bringing in the right order, for the purpose of remembrance and completion of the zero and a dented one, with the zero on it's right place on top, and the one on it's right place on the bottom.
    10 is the question "Is it all understood?" If yes start again, cut a zero, make a one, but remember in order to go forward, you can do so only with the zero in mind.
    The rest is childs play. That is the number's.
    Here is how you can build an algorithm for finding all the primes.
    Take a correct uninterrupted sequence of only odd numbers from three and onwards.
    If any of these numbers appear in a spreadsheet type of grid times table, starting from two times two and onwards!
    Then they are not primes.
    Meaning if three appears after two times two and onwards is not a prime. If eleven appears after two times two and onwards is not a prime, if sixty one appears after two times two and onwards, is not a prime.
    If odd number in line x, appears in a multiplication grid y (that from two times two and onwards), is false.
    If not, is true.
    Find the best and fastest grid way a computer can do.
    Run the fastest and best way of self filling and self deleting grids once primes of that gird are found, and start each grid again at the last odd number.
    For example, two time 1000001, whatever is the best fastest way for a computer
    (I think you can run even the times table only with odd numbers ((keeping only number two as well)) same as the line x, make it even faster for the computer.)

  • @ThelmaThais1
    @ThelmaThais1 Před rokem

    Heil sophie jermain. And hypatia of alexandria😊

  • @Wessen24
    @Wessen24 Před 4 lety +2

    28:07 i came up with a solution for this problem in 10 second.

    • @Wessen24
      @Wessen24 Před 4 lety

      There are infinitely many they become less frequent as p get bigger and bigger. By a simple equation.

    • @_okedata
      @_okedata Před 3 lety

      ​@@Wessen24 if they become less frequent how do you know that the frequency doesnt go down to zero for some really large p

    • @lorcanoconnor6274
      @lorcanoconnor6274 Před rokem

      It’s still unsolved.

  • @funkytransport
    @funkytransport Před rokem

    cant believe Oxford are using Revo mics. worst mics in the known world.

  • @escribidormadrid3463
    @escribidormadrid3463 Před 8 měsíci +1

    Was there the slightest need for a racist dig (3:38)?

  • @IqbalHamid
    @IqbalHamid Před rokem +2

    He speaks like a primary school child. He may be an accomplished mathematician, but he has an arrested ability to communicate.

    • @philcowdall9399
      @philcowdall9399 Před rokem +3

      there's nothing wrong with his accent or his ability to communicate. You seem to be the primary school child. Try focussing on the maths or else jog on.