The Sidef programming language
Ctrlk
  • Introduction
  • Preface
  • Getting Started
  • Sidef interpreter
  • Syntax and semantics
  • Programming tasks
    • 1
    • 2
    • 4
    • 9
    • A
    • B
    • C
    • D
    • E
    • F
    • G
    • H
    • I
    • J
    • K
    • L
    • M
    • N
    • O
    • P
      • Padovan n-step number sequences
      • Palindrome dates
      • Palindrome detection
      • Palindrome pairs
      • Palindromic gapful numbers
      • Palindromic primes
      • Palindromic primes in base 16
      • Pandigital prime
      • Pangram checker
      • Parallel brute force
      • Parallel calculations
      • Parsing
      • Partial function application
      • Partition an integer x into n primes
      • Partition function P
      • Pascal's triangle
      • Pascal matrix generation
      • Pathological floating point problems
      • Peano curve
      • Pell's equation
      • Pell numbers
      • Penrose tiling
      • Pentagram
      • Percentage difference between images
      • Percolation
      • Perfect numbers
      • Perfect shuffle
      • Perfect totient numbers
      • Perlin noise
      • Permutation test
      • Permutations
      • Permutations by swapping
      • Permutations with repetitions
      • Permutations with some identical elements
      • Pernicious numbers
      • Phrase reversals
      • Pi
      • Pick random element
      • Pierpont primes
      • Pig the dice game
      • Piprimes
      • Pisano period
      • Plasma effect
      • Playfair cipher
      • Playing cards
      • Plot coordinate pairs
      • Pointers and references
      • Polymorphic copy
      • Polymorphism
      • Polynomial derivative
      • Polynomial long division
      • Polynomial regression
      • Polynomial synthetic division
      • Population count
      • Positive decimal integers with the digit 1 occurring exactly twice
      • Power set
      • Powerful numbers
      • Practical numbers
      • Price fraction
      • Primality by trial division
      • Primality by Wilson's theorem
      • Prime conspiracy
      • Prime decomposition
      • Prime numbers p for which the sum of primes less than or equal to p is prime
      • Prime numbers which contain 123
      • Prime numbers whose neighboring pairs are tetraprimes
      • Prime reciprocal sum
      • Prime triplets
      • Primes - allocate descendants to their ancestors
      • Primes n*2 m 1
      • Primes which contain only one odd digit
      • Primes whose first and last number is 3
      • Primes whose sum of digits is 25
      • Primes with digits in nondecreasing order
      • Primorial numbers
      • Priority queue
      • Probabilistic choice
      • Problem of Apollonius
      • Product of divisors
      • Product of min and max prime factors
      • Program name
      • Program termination
      • Proper divisors
      • Pseudo-random numbers
        • Combined recursive generator MRG32k3a
        • Middle-square method
        • PCG32
        • Splitmix64
        • Xorshift star
      • Pseudorandom number generator image
      • Pythagoras tree
      • Pythagorean quadruples
      • Pythagorean triples
    • Q
    • R
    • S
    • T
    • U
    • V
    • W
    • X
    • Y
    • Z
  • The End
Powered by GitBook
On this page

Was this helpful?

  1. Programming tasks
  2. P

Pseudo-random numbers

Combined recursive generator MRG32k3aMiddle-square methodPCG32Splitmix64Xorshift star
PreviousProper divisorsNextCombined recursive generator MRG32k3a

Last updated 4 years ago

Was this helpful?