Sponsored Content
Full Discussion: generate random base 16
Top Forums Shell Programming and Scripting generate random base 16 Post 302702999 by Ygor on Wednesday 19th of September 2012 08:44:36 AM
Old 09-19-2012
Using awk...
Code:
$ rand=$(awk 'BEGIN{srand();for(i=1;i<=32;i++)printf "%x", int(rand()*16)}')

$ echo $rand
b9645ca2f0c5f55ed1411258d57b5bb5

$

 

10 More Discussions You Might Find Interesting

1. Programming

How to generate a random number?

How to generate a random integer with specific range(for example, from 1 to 1000)? Also, how to convert a floating point number into a integer? (2 Replies)
Discussion started by: MacMonster
2 Replies

2. Shell Programming and Scripting

Generate a random password

Hello All... Can someone help me generate a random password which will be 7 characters long which contains alpha-numeric characters using shell script. I am looking to store the output of the script that generates the password to a variable within a script and use it as the password. ... (5 Replies)
Discussion started by: chiru_h
5 Replies

3. Shell Programming and Scripting

generate random number in perl

Could any one tell how can I generate random number from (0, 100..200) in perl? Thanks! (2 Replies)
Discussion started by: zx1106
2 Replies

4. Programming

Generate Random Password in C

I need a function to generate a random alphanumeric password in C code. It needs to be between 6-8 characters and follow the following rules: Reject if same char appears # time: 4 or more Reject if same char appears consecutively: 3 or more I have the following random password working for... (2 Replies)
Discussion started by: vjaws
2 Replies

5. Shell Programming and Scripting

How to generate random strings from regx?

Hi, Guz! I'm working on a scripts compiler which needs a function to generate random strings. I think REGX may be a good solution to restrict the string format. Before DIYing I'd like asking for any existing libs or codes. Any help will be appreciated! (7 Replies)
Discussion started by: wqqafnd
7 Replies

6. Programming

Generate random number

I saw this formula to generate random number between two specified values in shell script.the following. $(((RANDOM%(max-min+divisibleBy))/divisibleBy*divisibleBy+min)) Give a example in book. Generate random number between 6 and 30.like this. $(((RANDOM%30/3+1)*3)) But I have a... (1 Reply)
Discussion started by: luoluo
1 Replies

7. Programming

generate array of random numbers

hi guys, I am writing a c program that generates a two dimensional array to make matrix and a vector of random numbers and perform multiplication. I can't figure out whats wrong with my code. It generates a matrix of random numbers but all the numbers in the vector array is same and so is the... (2 Replies)
Discussion started by: saboture88
2 Replies

8. Shell Programming and Scripting

Generate random numbers in script

i want to generate a random number through a script, and even if anyone reads the script, they wont be able to figure out what the random number is. only the person who setup the script would know it. something like this could work: random the full thread is here: ... (13 Replies)
Discussion started by: SkySmart
13 Replies

9. Shell Programming and Scripting

Need to generate a file with random data. /dev/[u]random doesn't exist.

Need to use dd to generate a large file from a sample file of random data. This is because I don't have /dev/urandom. I create a named pipe then: dd if=mynamed.fifo do=myfile.fifo bs=1024 count=1024 but when I cat a file to the fifo that's 1024 random bytes: cat randomfile.txt >... (7 Replies)
Discussion started by: Devyn
7 Replies

10. Shell Programming and Scripting

Help with generate a pair of random number

Hi, Is anybody experience generate a pair of random number by using awk command? I wanna to generate a pair of random number (range from 1 to 4124) and repeats it 416 times. Desired output 2 326 123 1256 341 14 3245 645 . . . I did write the below command: awk... (5 Replies)
Discussion started by: perl_beginner
5 Replies
drand48(3C)															       drand48(3C)

NAME
drand48(), erand48(), lrand48(), nrand48(), mrand48(), jrand48(), srand48(), seed48(), lcong48() - generate uniformly distributed pseudo- random numbers SYNOPSIS
Obsolescent Interfaces DESCRIPTION
This family of functions generates pseudo-random numbers using the well-known linear congruential algorithm and 48-bit integer arithmetic. In the following description, the formal mathematical notation [low,high) indicates an interval including low but not including high. and return nonnegative double-precision floating-point values uniformly distributed over the interval [0.0,1.0). and return nonnegative long integers uniformly distributed over the interval [0,2^31). and return signed long integers uniformly distributed over the interval [-2^31,2^31). and are initialization entry points, one of which should be invoked before either or is called. (Although it is not recommended practice, constant default initializer values are supplied automatically if or is called without a prior call to an initialization entry point.) and do not require an initialization entry point to be called first. All the routines work by generating a sequence of 48-bit integer values, X[i], according to the linear congruential formula X[n+1] = (a*X[n] + c) modulo m n>=0 The parameter m = 2^48; hence 48-bit integer arithmetic is performed. Unless has been invoked, the default multiplier value a and the default addend value c are given by a = 0x5DEECE66D (base 16) = 0273673163155 (base 8) c = 0xB (base 16) = 013 (base 8) The value returned by any of the functions or is computed by first generating the next 48-bit X[i] in the sequence. Then the appropriate number of bits, according to the type of data item to be returned, are copied from the high-order (leftmost) bits of X[i] and transformed into the returned value. The functions and store the last 48-bit X[i] generated in an internal buffer; that is why they must be initialized prior to being invoked. The functions and require the calling program to provide storage for the successive X[i] values in the array specified as an argument when the functions are invoked. That is why these routines do not have to be initialized; the calling program merely has to place the desired initial value of X[i] into the array and pass it as an argument. By using different arguments, and allow separate modules of a large pro- gram to generate several independent streams of pseudo-random numbers; i.e., the sequence of numbers in each stream do not depend upon how many times the routines have been called to generate numbers for the other streams. The initializer function sets the high-order 32 bits of X[i] to the 32 bits contained in its argument. The low-order 16 bits of X[i] are set to the arbitrary value 0x330E (base 16). The initializer function sets the value of X[i] to the 48-bit value specified in the argument array. In addition, the previous value of X[i] is copied into a 48-bit internal buffer, used only by and a pointer to this buffer is the value returned by This returned pointer, which can be ignored if not needed, is useful if a program is to be restarted from a given point at some future time; use the pointer to get at and store the last X[i] value, and then use this value to reinitialize via when the program is restarted. The initialization function allows the user to specify the initial X[i], the multiplier value a, and the addend value c. Argument array elements param[0-2] specify X[i], param[3-5] specify the multiplier a, and param[6] specifies the 16-bit addend c. After has been called, a subsequent call to either or restores the default multiplier and addend values for a and c, specified above. Obsolescent Interfaces generate uniformly distributed pseudo-random numbers. WARNINGS
and are obsolescent interfaces supported only for compatibility with existing DCE applications. New multithreaded applications should use and SEE ALSO
rand(3C), random(3M), thread_safety(5), random(7). STANDARDS CONFORMANCE
drand48(3C)
All times are GMT -4. The time now is 04:30 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy