Ask question

Ask question

All categories

3 years ago

13

Caleb was recently hired for a job with an annual income of $35,000. Using the federal income rate of 15 %, what amount should C

aleb expect to
pay in federal income tax?

1 answer:

Ipatiy [6.2K]3 years ago

7 0

Answer:

<h2 /><h2><em><u>an</u></em><em><u>swer</u></em><em><u> will</u></em><em><u> be</u></em><em> </em><em>5</em><em>2</em><em>5</em><em>0</em></h2>

<em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em><em>-</em>

<em> $35000 \times \frac{15}{100} = 350 \times 15 = 5250$ </em>

You might be interested in

Three to the power of three minus seven plus ten

BARSIC [14]

Answer:

30

Step-by-step explanation:

You’re correct

6 0

2 years ago

Read 2 more answers

Stefi likes smaller apple slices. The equation y = 9x represents the relationship between the number of apples, x, and the numbe

Lesechka [4]

Answer:

i chose d but it was wrong the answer is B got it right on edg

Step-by-step explanation:

7 0

2 years ago

Read 2 more answers

A club is selling hats and jackets as a fundraiser. Their budget is $1500, and they want toorder at least 250 items. Each hat co

Tom [10]

Let H be the number hats and J the number of jackets. Then, we can write,

$5H+8J\le1500$

Now, since they want 250 items at least, we can write

$H+J\le250$

Hence, the system of inequalities is

$\begin{gathered} 5H+8J\le1500 \\ H+J\le250 \end{gathered}$

6 0

9 months ago

If joe has 30$ in his bank account how much will he have if he deposits 1/3 of his paycheck each month for 6 months? His home pa

kakasveta [241]

Answer:

$870 in his bank account

Step-by-step explanation:

420 / 3 = 140

140 * 6 = 840

840 + 30 = 870

4 0

2 years ago

What is the smallest integer $n$, greater than $1$, such that $n^{-1}\pmod{130}$ and $n^{-1}\pmod{231}$ are both defined?

olasank [31]

First of all, the modular inverse of n modulo k can only exist if GCD(n, k) = 1.

We have

130 = 2 • 5 • 13

231 = 3 • 7 • 11

so n must be free of 2, 3, 5, 7, 11, and 13, which are the first six primes. It follows that n = 17 must the least integer that satisfies the conditions.

To verify the claim, we try to solve the system of congruences

$\begin{cases} 17x \equiv 1 \pmod{130} \\ 17y \equiv 1 \pmod{231} \end{cases}$

Use the Euclidean algorithm to express 1 as a linear combination of 130 and 17:

130 = 7 • 17 + 11

17 = 1 • 11 + 6

11 = 1 • 6 + 5

6 = 1 • 5 + 1

⇒ 1 = 23 • 17 - 3 • 130

Then

23 • 17 - 3 • 130 ≡ 23 • 17 ≡ 1 (mod 130)

so that x = 23.

Repeat for 231 and 17:

231 = 13 • 17 + 10

17 = 1 • 10 + 7

10 = 1 • 7 + 3

7 = 2 • 3 + 1

⇒ 1 = 68 • 17 - 5 • 231

Then

68 • 17 - 5 • 231 ≡ = 68 • 17 ≡ 1 (mod 231)

so that y = 68.

3 0

2 years ago