## Where all the folks that use to use the place.

I miss them.

Tags: ragknot@gmail.com
Posted by ragknot under Tom (No Respond)

I miss them.

Tags: ragknot@gmail.com
Posted by ragknot under Tom (No Respond)

How can someone compute the X in this equation.

X=A+B*Log(C*D*X)

When the A=12 , B=14, C=10, D=9, and X will be the right solution,

Now one can compute it, but I need to use Excel.Â

If you guess an X and compute it then several solutions willÂ

compute the X right. Now here is the right solution.

In Cell A1 enter a guess, and in cell A2 enter =12+14*LOG(10*9*A1)

where the X is using your guess in Cell A1. (the A1 will change each loop.)

Then copy the cell A2 down to about 20 more cells. An when the X is right

the computing will stop changing. The solution will be the Log() will compute

it right. It you change the other numbers but the X is in the Log, The ExcelÂ

will find the right solution for X.

I am in the profile of some pretty great things.

If you just want to play, push me.

This is hint #3.

I am _______________ ?

Andy, Bob, Charlie, and Dave are ready to play another round of cards. This time it is Charlie’s turn to deal.

The cards are sorted and Charlie decides to only use the Red cards (Hearts & Diamonds).

Three [3] cards are dealt one-at-a-time to each of the four [4] players. Highest pair wins; Aces are low.

If no one wins, the cards are shuffled and re-dealt until there is a winner.

What are the odds of Charlie dealing himself a pair of 10’s AND **winning**?

Posted by ragknot under Tom (2 Responds)

Equation is â€¦ X=10+Log(20*X)

Loop 1 is =10+LOG(20*D4) the D4 is the guessed number above it. (Cell D4 where I guess 100)

Eash loop uses X for the number above it and before 20 loops it stops changing.

Guess a X 100 Changed =

Loop 1 13.30102999566400000000 -86.698970004336000

Loop 2 12.42491526851930000000 -0.876114727144710

Loop 3 12.39532343141620000000 -0.029591837103039

Loop 4 12.39428785897010000000 -0.001035572446172

Loop 5 12.39425157414140000000 -0.000036284828671

Loop 6 12.39425030272310000000 -0.000001271418261

Loop 7 12.39425025817260000000 -0.000000044550490

Loop 8 12.39425025661160000000 -0.000000001561048

Loop 9 12.39425025655690000000 -0.000000000054699

Loop 10 12.39425025655500000000 -0.000000000001917

Loop 11 12.39425025655490000000 -0.000000000000068

Loop 12 12.39425025655490000000 0.000000000000000

Loop 13 12.39425025655490000000 0.000000000000000

Loop 14 12.39425025655490000000 0.000000000000000

Loop 15 12.39425025655490000000 0.000000000000000

Loop 16 12.39425025655490000000 0.000000000000000

Loop 17 12.39425025655490000000 0.000000000000000

Loop 18 12.39425025655490000000 0.000000000000000

Loop 19 12.39425025655490000000 0.000000000000000

Loop 20 12.39425025655490000000 0.000000000000000

Posted by ragknot under Tom (7 Responds)

I did this easy and true computation about 3 years ago.

To compute X, when X is on both sides of the equation,

but one side, the X, and maybe other numbers are in a Log,

you can easily compute the X easy.

Example, find the X to several digits when X=10+Log(20*X).

Just guess an X and compute the =10+Log(20*X).

Then use the solution for the next X as a new loop.

Then if you guess the first X as 1 to 1000 the X can be

computed to many digits in about 8 loops.

So compute this X to about 10 digits.

Example: First use any number for the first X.

If you use X=1 Â for the first X the first loop will give 11.301029995664

If you use X=100 Â for the first X the first loop will give 13.301029995664

Then use the first loop X, for the next X loop. Â After some loops the

X will stop changing. But if you need about 100 digits, it might take

about 30 loops

Posted by Chris under Tom (7 Responds)

A Mr. Piyush has posted the following:

Find the missing number

5 : 24 :: 8 : x

Options are:

a. 65

b. 63

c. 62

d. 64

Posted by Zorglub under Tom (5 Responds)

Three recipents R(0), R(1) and R(2) each contain an integer volume v_{0}(0) â‰¥ v_{0}(1) â‰¥ v_{0}(2) â‰¥ 1. Â Each recipient is large enough to contain the combined volumes. Â You are allowed to transfer some liquid from one recipient to another, only if the receiving one doubles its volume. Â Show that there is always a way to empty out one recipient in finitely many steps.

Example: If the initial volumes are 17, Â 8, Â 5 the sequence of volumes could be

R(0) Â R(1) Â R(2)

17 Â Â Â 8 Â Â Â 5

17 Â Â 3 Â Â Â 10

17 Â Â 6 Â Â Â 7

17 Â Â 12 Â Â Â 1

16 Â Â 12 Â Â 2

14 Â Â 12 Â Â 4

14 Â Â Â 8 Â Â Â 8

14 Â Â Â 16 Â Â 0 Â => Â R(2) is finally empty.

Posted by Zorglub under Tom (5 Responds)

A function f takes a positive integer and returns another one by moving the leftmost digit to the right.

For example f(12345) = 23451

What is the smallest strictly positive integer n such that f(n) = 1.5 n

In a test involving yes/no answers, the probability that the official answer is correct is t, the probability of getting the real correct answer is b for a boy and g for a girl. If the probability that a randomly chosen boy or girl of getting the official answer to a question is 1/2, then what is the ratio of boys to girls who took the test?