DℝOℕ∈

@d_r_o_n_e

Math addict

Milky Way
Vrijeme pridruživanja: kolovoz 2016.

Tweetovi

Blokirali ste korisnika/cu @d_r_o_n_e

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @d_r_o_n_e

  1. proslijedio/la je Tweet
    prije 14 sati
    Poništi
  2. proslijedio/la je Tweet
    2. velj
    Poništi
  3. proslijedio/la je Tweet
    2. velj
    Prikaži ovu nit
    Poništi
  4. proslijedio/la je Tweet
    2. velj
    Prikaži ovu nit
    Poništi
  5. proslijedio/la je Tweet
    2. velj
    Poništi
  6. proslijedio/la je Tweet
    31. sij

    2乗すると回文数になる数を見つけました!

    Poništi
  7. 31. sij

    Double Mersenne prime = 2^(Mersenne prime) – 1 Triple Mersenne prime = 2^(double Mersenne prime) – 1 2^(2^(2² – 1) – 1) – 1 = 127 and 2^(2^(2³ – 1) – 1) – 1 = 170141183460469231731687303715884105727 are not only double but also triple Mersenne primes.

    Poništi
  8. 30. sij

    Functions primitives graphs

    Poništi
  9. 29. sij

    n-parasitic number is a natural number which can be multiplied by n by moving the last digit to the front

    Poništi
  10. 22. sij

    OR, AND, XOR, IMPLY, NOR, NAND, XNOR, NIMPLY, NOT ∨, ∧, ⊻, →, ↓, ↑, ↔, ↛, ¬

    Poništi
  11. 21. sij

    Firoozbakht's conjecture: (n+1)st prime is less than nth prime to the power of (1+1/n)

    Poništi
  12. 20. sij

    (2-x)/(x⁴-x³-x+1)=[(2x+3)/(x²+x+1)+1/(x-1)²-2/(x-1)]/3

    Poništi
  13. proslijedio/la je Tweet
    18. sij
    Poništi
  14. 19. sij

    ∃ 224 n-digit numbers where last k digits are divisible by k-th prime for k=1..n leading zero(s) are allowed (ignored) Complete list and example:

    Poništi
  15. 18. sij

    Today's derivative

    Poništi
  16. 17. sij

    Formula for the number of trailing zeros in n! For example the number of trailing zeros in 100! is 24 ∵ 100/5 + 100/5² = 20 + 4 = 24

    Poništi
  17. 16. sij

    One more or one less than primorial (the product of the first n primes) primes:

    Poništi
  18. 15. sij

    Bonse's inequality The product of the first n primes is bigger than the square of the (n+1)st prime where n ≥ 4

    Poništi
  19. 14. sij

    ∃ 200 n-digit numbers where first k digits are divisible by k-th prime for k=1..n Complete list and example:

    Poništi
  20. 13. sij

    The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem.

    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·