Erlang程序设计

按有用程度 按页码先后 最新笔记

• 

  第364页

  23夜

  %% Fermat's little theorem says that if %% N is a prime and if A < N then %% A^N mod N = A 还有这个Fermat小定理的证明？。 %% pow(A, B, M) => (A^B) mod M %% examples pow(9726,3533,11413) = 5761 %% pow(5971,6597,11413) = 9726 pow(A, 1, M) -> A rem M; pow(A, 2, M) -> A*A rem M; pow(A, B, M) -> B1 = B div 2, B2 = B - B1, %% B2 = B1 o... (更多)

  %% Fermat's little theorem says that if %% N is a prime and if A < N then %% A^N mod N = A

  还有这个Fermat小定理的证明？。

  %% pow(A, B, M) => (A^B) mod M %% examples pow(9726,3533,11413) = 5761 %% pow(5971,6597,11413) = 9726 pow(A, 1, M) -> A rem M; pow(A, 2, M) -> A*A rem M; pow(A, B, M) -> B1 = B div 2, B2 = B - B1, %% B2 = B1 or B1+1 P = pow(A, B1, M), case B2 of B1 -> (P*P) rem M; _ -> (P*P*A) rem M end.

  这个Pow计算方法求数学系的高人解释。二次互反律吗？

  is_prime(Ntest, N, Len)

  Ntest设成100，你开的这个公司可能卖假货而破产阿！ 亲爱的Joe。 (收起)

  2012-02-07 20:09:17   回应

  收藏

  推荐
• 

  第363页

  23夜

  %% make a prime with at least K decimal digits. %% Here we use 'Bertrand's postulate. %% Bertrands postulate is that for every N > 3, %% there is a prime P satisfying N < P < 2N - 2 %% This was proved by Tchebychef in 1850 %% (Erdos improved this proof in 1932) 想知道这个定理的证明，问下想学学数论看什么东西呢？ (更多)

  %% make a prime with at least K decimal digits. %% Here we use 'Bertrand's postulate. %% Bertrands postulate is that for every N > 3, %% there is a prime P satisfying N < P < 2N - 2 %% This was proved by Tchebychef in 1850 %% (Erdos improved this proof in 1932)

  想知道这个定理的证明，问下想学学数论看什么东西呢？ (收起)

  2012-02-07 20:07:47   回应

  收藏

  推荐
• 

  第322页

  23夜

  Mnesia这个名字取的有意思，那个transact函数也很有趣。 不过，Couchdb对于这个东西不感冒 (更多)

  Mnesia这个名字取的有意思，那个transact函数也很有趣。

  不过，Couchdb对于这个东西不感冒 (收起)

  2012-02-06 20:40:34   回应

  收藏

  推荐

• 

  第12页

  congxinkitty

  在学习一门语言之前，首先要了解它的特点，以及与其他语言的区别。 下面这一段是Armstrong在扉页上写的一段话： The world is parallel. If we want to write programs that behave as other objects behave in the real world, then these programs will have a concurrent structure. Use a language that was designed for writing concurrent applications, and development becomes a lot easier. Erlang programs m... (更多)

  在学习一门语言之前，首先要了解它的特点，以及与其他语言的区别。

  下面这一段是Armstrong在扉页上写的一段话：

  The world is parallel. If we want to write programs that behave as other objects behave in the real world, then these programs will have a concurrent structure. Use a language that was designed for writing concurrent applications, and development becomes a lot easier. Erlang programs model how we think and interact.

  强调了两点：一是parallel，二是concurrent。

  也就是说Erlang本身就是支持并行和并发的。

  （小恶魔：在这时，我们不禁要问，难道其他的语言就不支持并行并发了吗？）

  Contents

  Begin

  Getting Started

  Sequential Programming

  Exceptions

  Advanced Sequential Programming

  Compiling and Running Your Program

  Concurrency

  Concurrent Programming

  Errors in Concurrent Programs

  Distributed Programming

  IRC Lite

  Interfacing Techniques

  Programming with Files

  Programming with Sockets

  ETS and DETS: Large Data Storage Mechanisms

  OTP Introduction

  Mnesia: The Erlang Database

  Making a System with OTP

  Multicore Prelude

  Programming Multicore CPUs

  看了目录之后，Sequential - Concurrency - Distributed - Multicore (收起)

  2011-10-26 18:24:07   回应

  收藏

  推荐
• 

  第16页

  23夜

  Once upon a time a programmer came across a book describing a funny programming language. It had an unfamiliar syntax, equal didn’t mean equals, and variables weren’t allowed to vary. Worse, it wasn’t even object-oriented. The programs were, well, different.... Not only were the programs different, but the whole approach to programming was different. The author kept on and on about concurr... (更多)

  Once upon a time a programmer came across a book describing a funny

  programming language. It had an unfamiliar syntax, equal didn’t mean

  equals, and variables weren’t allowed to vary. Worse, it wasn’t even

  object-oriented. The programs were, well, different....

  Not only were the programs different, but the whole approach to programming

  was different. The author kept on and on about concurrency

  and distribution and fault tolerance and about a method of programming

  called concurrency-oriented programming—whatever that might mean.

  But some of the examples looked like fun. That evening the programmer

  looked at the example chat program. It was pretty small and easy to

  understand, even if the syntax was a bit strange. Surely it couldn’t be

  that easy.

  The basic program was simple, and with a few more lines of code, file

  sharing and encrypted conversations became possible. The programmer

  started typing....

  这段话写的让人想笑…^-^ (收起)

  2012-01-06 19:33:50   回应

  收藏

  推荐
• 

  第40页

  23夜

  The characters in a string represent Latin-1 (ISO-8859-1) character codes. Latin-1貌似不妙阿 (更多)

  The characters in a string represent Latin-1 (ISO-8859-1) character

  codes.

  Latin-1貌似不妙阿 (收起)

  2012-01-08 00:03:06   回应

  收藏

  推荐

• 

  第364页

  23夜

  %% Fermat's little theorem says that if %% N is a prime and if A < N then %% A^N mod N = A 还有这个Fermat小定理的证明？。 %% pow(A, B, M) => (A^B) mod M %% examples pow(9726,3533,11413) = 5761 %% pow(5971,6597,11413) = 9726 pow(A, 1, M) -> A rem M; pow(A, 2, M) -> A*A rem M; pow(A, B, M) -> B1 = B div 2, B2 = B - B1, %% B2 = B1 o... (更多)

  %% Fermat's little theorem says that if %% N is a prime and if A < N then %% A^N mod N = A

  还有这个Fermat小定理的证明？。

  %% pow(A, B, M) => (A^B) mod M %% examples pow(9726,3533,11413) = 5761 %% pow(5971,6597,11413) = 9726 pow(A, 1, M) -> A rem M; pow(A, 2, M) -> A*A rem M; pow(A, B, M) -> B1 = B div 2, B2 = B - B1, %% B2 = B1 or B1+1 P = pow(A, B1, M), case B2 of B1 -> (P*P) rem M; _ -> (P*P*A) rem M end.

  这个Pow计算方法求数学系的高人解释。二次互反律吗？

  is_prime(Ntest, N, Len)

  Ntest设成100，你开的这个公司可能卖假货而破产阿！ 亲爱的Joe。 (收起)

  2012-02-07 20:09:17   回应

  收藏

  推荐
• 

  第363页

  23夜

  %% make a prime with at least K decimal digits. %% Here we use 'Bertrand's postulate. %% Bertrands postulate is that for every N > 3, %% there is a prime P satisfying N < P < 2N - 2 %% This was proved by Tchebychef in 1850 %% (Erdos improved this proof in 1932) 想知道这个定理的证明，问下想学学数论看什么东西呢？ (更多)

  %% make a prime with at least K decimal digits. %% Here we use 'Bertrand's postulate. %% Bertrands postulate is that for every N > 3, %% there is a prime P satisfying N < P < 2N - 2 %% This was proved by Tchebychef in 1850 %% (Erdos improved this proof in 1932)

  想知道这个定理的证明，问下想学学数论看什么东西呢？ (收起)

  2012-02-07 20:07:47   回应

  收藏

  推荐
• 

  第322页

  23夜

  Mnesia这个名字取的有意思，那个transact函数也很有趣。 不过，Couchdb对于这个东西不感冒 (更多)

  Mnesia这个名字取的有意思，那个transact函数也很有趣。

  不过，Couchdb对于这个东西不感冒 (收起)

  2012-02-06 20:40:34   回应

  收藏

  推荐