Skip to main content

カート

VIP 特典をお楽しみいただけます!

購入できない書籍
お買い物かごをご確認ください。購入不可の商品を削除できます。削除されなかった購入不可の商品は、購入手続き時に削除されます。

おすすめ

Loading...


Mathematics 電子書籍シリーズ

199 件) 件の検索結果
Skip side bar filters
  • Proof of Riemann's Hypothesis

    Mathematics, #1

    James Constant ...
    シリーズ 本: 1 - Mathematics
    It has already been shown that all zeros are in the critical strip and that they are symmetric about the critical line. I make several assumptions and show that all zeros are on the critical line and that Riemann's functional equation presents a problem. The assumptions are, first, that Riemann's zeta function is single valued at each point of the critical strip (it is not), second, Riemann's ... もっと見る

    950 円

  • Riemann's Analytic Expression Disproved

    Mathematics, #2

    James Constant ...
    シリーズ 本: 2 - Mathematics
    By rearranging terms, Riemann's zeta function ζ(s) can be made to converge or diverge to any value desired. Accordingly, Riemann's analytic extension to interval 0≤x≤1 is irrelevant to determining primes. ... もっと見る

    950 円

  • Extended Zeta Functions Prove or Dis-prove Riemann's Hypothesis

    Mathematics, #3

    James Constant ...
    シリーズ 本: 3 - Mathematics
    While extended zeta functions support investigations of Riemann's hypothesis and estimates for the Prime Number Theorem, some zeta functions offer better prospects for providing easy proofs, or disproofs. In 1859, Riemann had the idea to define Euler's function ε(x)=∑m^x for all complex numbers s=x+iy by analytic extension. This extension is important in number theory and plays a central role in ... もっと見る

    950 円

  • Turing’s Test Update

    Mathematics, #5

    James Constant ...
    シリーズ 本: 5 - Mathematics
    Scientists have long puzzled why only humans managed to colonize the entire globe. A recent hypothesis holds that cooperation and projectile weapons account for man's world domination. Better yet is the proposition that all living things are computers but humans have mastered the arts of making useful artifacts, objects that existed in their minds. Book looks at how programming electronic brains ... もっと見る

    950 円

  • Beal Fermat and Pythagoras Triplets

    Mathematics, #8

    James Constant ...
    シリーズ 本: 8 - Mathematics
    Proof that Beal And Fermat Triplets Cannot Exist. This is a single page proof of Fermat's Last Theorem and Beal's conjecture in terms of Euclid's formulas for triplets. ... もっと見る

    1,600 円

  • Finding Pythagorean Primes

    Mathematics, #9

    James Constant ...
    シリーズ 本: 9 - Mathematics
    It is well known that finding large prime numbers is difficult.i We have no algorithm to find primes although we have algorithms to narrow the search. The two main tools we have are theory and empirical data both supported by computers. But, with increased number size of numbers computation becomes prohibitive in time and resources. For small prime numbers, it is easy as we have exhaustively ... もっと見る

    1,600 円

  • The Navier-Stokes Millenium Problem

    Mathematics, #4

    James Constant ...
    シリーズ 本: 4 - Mathematics
    Solutions of the Navier–Stokes equations often include turbulence, which remains one of the greatest unsolved problems in physics, despite its immense importance in science and engineering. The Clay Mathematics Institute in May 2000 made this problem one of its seven Millennium Prize problems in mathematics. It offered a US $1,000,000 prize to the first person who provides a solution for a ... もっと見る

    1,600 円

  • Fermat's Last Theorem and Beal's Conjecture

    Mathematics, #6

    James Constant ...
    シリーズ 本: 6 - Mathematics
    In this short book Fermat's Last Theorem is easily proven and Beals Conjecture is easily Disprovenusing Pythagora's Theorem ... もっと見る

    800 円

  • Hilbert Godel Turing and the Computer Decision Problem

    Mathematics, #7

    James Constant ...
    シリーズ 本: 7 - Mathematics
    Is there a procedure or algorithm that can decide whether statements, mathematical or non-mathematical, are true or false, win or draw? The broader decision problem can be stated as follows: Even though a mathematical or non-mathematical statement is undecidable in general, it may be possible to find a special algorithm that makes a computer model stop or checkmate. A computer model stops when a ... もっと見る

    1,600 円