The slaying of Kansas City, Missouri, attorney Tom Pickert in his front yard last year October sent waves through his quiet neighborhood that is residential its [obvious] senselessness. The alleged old man has been has been charged with murder.

Witness accounts, however, provided a point that is police that is starting An older, gray-haired man parked a white van across the street from Pickert's home that morning. A van that is similar seen speeding away in the brief moments after the attorney was gunned down.

Farmer and baby furniture maker David Jungerman — the defendant that is losing a lawsuit that is civil Pickert had won months earlier — was being linked on social media to the shooting. Local media reports noted that he owned a white van, physically matched the suspect's description and had a "history of violent and vindictive behavior."

But in the weeks after the shooting, Kansas City police explicitly denied Jungerman, 80, was a— that is Wednesday that is suspect prosecutors announced at a news conference they had enough evidence, including of Jungerman accidentally recording himself saying he had committed murder.

WATCH THE VIDEO BELOW

https://www.naijapilot.com/wp-content/uploads/2018/04/Man-charged-with-murder-of-Kansas-City-attorney-after-accide.mp4

"People, uh, know that I murdered that son of a b----," he is quoted as saying, according to a probable cause affidavit.

 Jungerman pleaded not guilty Thursday to the charges in Jackson County Circuit Court. His attorney, Daniel Ross, said his client "emphatically denies" the allegations against him.
On Wednesday, Pickert's widow, Emily Riegel, thanked investigators as they laid out the charges of first-degree murder and armed criminal action.

"For 168 days we've all wondered if this day would come," Riegel told reporters. "We had hoped and prayed. We've been in the turmoil of the unknown."
According to Jackson County prosecutors, that turmoil began when Jungerman and Pickert first became entangled in a legal case in 2012.

Jungerman didn't call police or warn he would shoot, Harris said, so he sued for assault and battery. In July, a jury awarded Harris $5.75 million.

Pickert during the trial said Jungerman had a history of allegedly pulling a gun on people or shooting at them. Jungerman, who argued that he was acting in self-defense, said he was going to appeal the case.

Then, on Oct. 25, Pickert was murdered after returning home from walking his two young sons to school.

https://www.naijapilot.com/crime/man-charged-with-murder-of-lawyer-after-accidentally-recording-confession/

Institution: Osun State University.
Course: Accounting.
Level: 400.

I just launched a Q&A site https://www.billionairesden.com What do you think?

What is your blog address?

I feel so terrible for not watching this match . I .

Finstar:



One of the reasons why I respect most atheist is because they are usually neutral in their dealing with any religion. But in your case, reverse comes to play. Maybe because you were once a Muslim.. I can't tell.. But I think it's high time you stop being sentimental and treat every religion the same. I'm not a Christian. I don't belong to any religious label, but I don't allow anything becloud my judgement.

Christians are constantly being attacked in this forum, especially by your fellow atheist. I believe that everyone have the right to belief whatever they want, the moment you realise that will be the moment wisdom sets in. Sometimes, I see Muslims masturbate on Christian threads and go free..

I know that this is your forum, but if you don't take time, you'll end up regretting.. You won't live forever.. At that last minute, in your death bed, that is when you'll discover that the life you lived wasn't truly life.. Death has a way of giving a last minute enlightenment and that's why people end up regretting what they didn't do.. Thank You.

Very reasonable comment.

The church has no name right? RIP Lady.

These people are very stupid.

Here is an advice to those who have laid their hands on the new expensive and sleek IPhone X; don't let the phone drop, you can't afford to let it crack. Although Apple has assured its customers that the glass of the new IPhone 8 and IPhone X are stronger than those on the previous models, so they can't break easily.

However there is no 100% guarantee that a phone won't be damaged or cracked if dropped.  The phone boasts of an all-glass back, therefore owners run the risk of cracking either sides of the phone.

According to a report on the Apple website, repair cost for the IPhone X screen is $275 dollars. This is because the screen or display is the most expensive part of the new phone. Going by today's exchange rate, $275 is ₦97900.

Apple new IPhone X costs $1000 (₦356000).. The repair cost for IPhone 8 screen or display is  $169(₦60164) and the phone costs around $800(₦284800). You can't afford to drop these gadgets.
Source: http://www.futurebrains.com.ng/2017/10/it-will-cost-you-around-275-to-repair.html

Hot thread. Hmm.

DharkPoet:

I was about saying the same thing, and I think this is why Seun doesn't take this board seriously. A meaningful topic would most likely degrade into a battlefield for the bosses. Some of us just want to learn.

Exactly sir!
I started noticing this from Page 3 or so. It's not so good.
Nobody knows it all. Nobody.

This thread has finally degenerated into 'clash of egos'?

Jenifa123:
Trolling through

It's a good thing to do.

I love this thread.

DanielTheGeek:
But before then, I have a simple question.. I don't need to see code; just logical reasoning..
(Taken from an interview of a company I worked for)

In a co-ordinate plane, a line segment is drawn from the origin to a point A(x,y). With great efficiency, find the number of cells the line passes through Assuming X and Y are ints...

Google may not be of too much help, this is largely theoretical.

Mod: let's have more of this kind of questions as the ones involving code can easily be Googled or outsourced.. This tests the fundamental knowledge of computer science.. Programming is more of thinking than coding

I may ve wrong but this can be solved by finding the distance between the two points. On the Euclidean plane , i think density equals distance.

seunthomas:
Using GPS abi wetin.....

Lol, just joking sir. Have fun!

dhtml118:
But i don old now, since dhtml18 all the way to dhtml118 - that is like 100 years difference.

I checked your website few minutes ago, it's really nice. yeah, my first time.
I envy professional web developers. Nice one!
Bearnana, do you have a website?

asalimpo:


Should have computed the prime number outside the loop that way the program will run faster.
Computing 'isPrime(n)' every time the loop runs,when n is static, is just disastrous to performance.

Good evening.
You may be right. The solution gets the job done and it took '00:00:00.1405923' which in my opinion is still good....
if you have any other method, you can put it forward.I will be glad to see it.
Can you help me locate the OP?

DharkPoet:


Here you go @bolkay47 done in PHP

<?php
// Find the GCD between two numbers
function getGCD($num1, $num2) {
   while ($num2 != 0){
     $t = $num1 % $num2;
     $num1 = $num2;
     $num2 = $t;
   }
   return $num1;
}

function PHIfunction($n) {
	if ($n == 1) {
		return 1;
	}
	$count = 0;
	for ($i=1; $i < $n; $i++) {
		if (getGCD($i, $n) === 1) {
			$count++;
		}
	}
	return $count;
}

echo PHIfunction(9);
// returns 6

echo PHIfunction(20);
// returns 8

echo PHIfunction(87109)
// returns 79180

?>

Nice one Sir!.....but where is the OP of this thread?
This is the answer in C#.

using System;
using System.Collections.Generic;

namespace project_euler
{
class Program
{
  private static List<int> primes = GenerateRangeOfPrimes(1000,5000);

  static void Main()
  {
      //Problem 70
      DateTime start = DateTime.Now;
      decimal min = 100;
      int number = 1;

      for (int j = primes.Count - 1; j >= 0; j--)
          for (int k = j - 1; k >= 1; k--)
          {
              int i = primes[j]*primes[k];
              if (i < 10000000)
              {
                  int totient = (primes[j] - 1)*(primes[k] - 1);
                  if (IsPermutation(i, totient))
                      if ((decimal) i/totient < min)
                      {
                          min = (decimal) i/totient;
                          number = i;
                          Console.WriteLine(number + ": " + min + " p1: " + primes[k] + " p2: " + primes[j]);
                      }
              }
          }
      TimeSpan time = DateTime.Now - start;
      Console.WriteLine("This took {0}", time);
      Console.ReadKey();
  }

  private static bool IsPermutation(int m,int n)
  {
      char[] c = m.ToString().ToCharArray();
      char[] d = n.ToString().ToCharArray();
      Array.Sort(c);
      Array.Sort(d);
      string s = new string(c);
      string t = new string(d);
      if (s == t) return true;
      return false;
  }

  private static bool IsPrime(int n)
  {
      if (n < 2) return false;
      if (n == 2) return true;
      for (long i = 2; i <= Math.Sqrt(n); i++)
          if (n % i == 0) return false;
      return true;
  }

  private static List<int> GenerateRangeOfPrimes(int m,int n)
  {
      var p = new List<int> { 2, 3 };
      for (int i = 5; i <= n; i += 2)
          if (IsPrime(i))
              p.Add(i);
      while (p[0] < m)
          p.Remove(p[0]);
      return p;
  }
}
}

The permutation which produces the smallest ratio is 8319823 and this produces the fraction 1.0007090511248112805403174047.
Credits: Sir Alan of http://siralansdailyramble..com.ng

bearnana:
With PHP

<?php
		function generate_primes($n) {
	    	$limit = sqrt($n);
	    	$primes = array_fill(0, $n, 0);
	    	$primes[0] = $primes[1] = 1;
	    	for($i = 2; $i <= $limit; $i++) {
	    		if($primes[$i] === 0) {
	    			for($j = 2; $j < $n; $j++) {
	    				if($i*$j > $n)
	    					break;
	    				else
	    					$primes[$i*$j] = 1;
	    			}
	    		}
	    	}
	    	return sizeof($primes)-1;
	    }


?>

I just noticed that this is incomplete, it only solves the Euler Totient function... I'll update later...

Nice!

Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n
which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
The number 1 is considered to be relatively prime to every positive number, so φ(1)=1.
Interestingly, φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.
Find the value of n, 1 n 107, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum.

Nice thread!
You should consider posting some interesting questions or challenges so as to keep the thread 'warm' and interactive.

asalimpo:
You're right. I thought i had discovered something new!! miscontrued the syntax.
2^nb = 2^(n*b) = 2^n^b. correction: 3^27 != 27^3.
I've been so used to computer syntax, the math connotation isnt obvious. a^bc is a^(b*c). It's an old known law.

It's alright sir!

asalimpo:

You're right. I thought i had discovered something new!! miscontrued
the syntax.

2^nb = 2^(n*b) = 2^n^b.
correction:
3^27 != 27^3.

I've been so used to computer syntax, the math connotation isnt obvious.
a^bc is a^(b*c). It's an old known law.

Sorry, I wanted to type the not equal sign.
I wanted to illustrate the bottleneck using those examples.

For a^b^c. Consider:
2^2^2=2^(2^2)=2^4=16.
CHECK THIS OUT
(2^2)^2=4^2=16.
CHECK
3^3^3=3^(3^3)=3^27.
3^3^3=3^3(^3)=27^3.
Therefore 3^27=27^3.
I applied the power rule just that this kind of problem require you to simplify the powers.
I agree with the fact that authors tend to overlook it.
....except in further or complex mathematics.

asalimpo:
I dont understand you:
but if this is what you mean - 2^3(4)= (8(4))=32 That's not what i mean.

i mean:
5^(6*7) = (5^6)^7 = 5^6^7 =5^7^6
the * is translated to ^. notice that? notice how order doesnt matter for the numbers in the brackets just like it works for normal *. e.g a*b = b*a, 5^(6*7) = 5^(7*6).
Interesting.
This old stuffs nothing new. mathematicians know it, just discovered it and wondered why it's not it maths books and not in the typical laws of indices were were taught in school.
There's a law that works for multiplication like there is for addition a^(b+c) = a^b * a^c , subtraction, etc.

p^m(n)=p^(mn). 2^2(5)=2^10.

asalimpo:
Is this a valid law of indices? a^(b*c) = (a^b)^c. = a^(b^c) = a^(c*b).
plug in any number for a,b or c.
Discovered by mistake when thinking on a problem. if it's a law, why were'nt we so taught in school? Secondary school though. huh!! We were taught +,-,division, why not multiplication?

I guess you are referring to the power rule. p^m(n)=p^mn etc. The power rule exists and has always been taught.